I have a triangulated mesh. Assume it looks like an bumpy surface. I want to be able to find all edges that fall on the surrounding border of the mesh. (forget about inner vertices) I know I have...

I am trying to create a Convex Hull using the library Scipy and ConvexHull. As far as I know, it calls QHull. The problem appears when the points I want to add do not have 'full dimension'. Exampl...

Suppose I have a point cloud given in 6-dimensional space, which I can make as dense as needed. These points turn out to lie on the surface of a lower-dimensional polytope (i.e. the point vectors (...

I have a set of points in the plane and I want to find all convex polygons without including a point inside them. For example I want to find all triangles, all four sized polygons, all four five s...

Does anyone know a relatively fast algorithm for decomposing a set of polygons into their distinct overlapping and non-overlapping regions, i.e. Given a set of n polygons, find all the distinct reg...

Given a convex polygon, I am trying to grow its shape (as in "maximal area") while preserving its diameter. The diameter is defined as the length of the longest segment that can be placed within th...

I recently asked this question about how to cut down a concave polygon to convex ones, and I was suggested to do Triangulation or Polygon Partitioning. The library I'm using (SFML\Box2D) only take...

I Would like to check if a set of N points describe a convex polygon or not I was wondering if there is a good algorithm for that ? Here is some approaches I thought of: 1.Convex Hull algorith...

An O(n) algorithm to detect if a line intersects a convex polygon consists in checking if any edge of the polygon intersects the line, and look if the number of intersections is odd or even. Is th...

I found some solutions, but they're too messy.