Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in computational-geometry

Sublinear but simple Dynamic Convex Hull algorithm?

Determining if a point is inside a polyhedron

Finding number of concurrent events given start and end times

Find medial axis of a polygon using C#

Compute the centroid of a 3D planar polygon

How to generate random vertices to form a convex polygon in c++?

Given a vector of points (possibly out of order), find polygon (not convex hull)

how to determine whether a point lies inside a rectangle? [duplicate]

Find a region with maximum sum of top-K points

Algorithm to find the largest inscribed chord of a closed polyline

How to find the farthest point (from a set of points) from a given point efficiently?

3d intersections of triangles algorithm - Displaying the topmost plane

Python : Ramer-Douglas-Peucker (RDP) algorithm with number of points instead of epsilon

How to find the nearest line segment to a specific point more efficently?

Fast ellipsoid(s) intersection algorithm

Convert polygons into mesh

Why storing data only in the leaf nodes of a balanced binary-search tree?

Given a set of n points (x,y), is it possible to find the number of pairs of points with negative slopes between them in O(n logn) time?

Best dynamic data structure for 2d circle nearest neighbor

Breakpoint Convergence in Fortune's Algorithm