Simple Polygon Convex Hull
Jump to navigation
Jump to search
A Simple Polygon Convex Hull is a Discrete Geometry that ...
- AKA: Convex Hull of a Simple Polygon.
- See: Erdős–Nagy Theorem, Discrete Geometry, Computational Geometry, Simple Polygon, Convex Hull, Linear Time, Convex Hull Algorithms, Polygonal Chain.
References
2020
- (Wikipedia, 2020) ⇒ https://en.wikipedia.org/wiki/Convex_hull_of_a_simple_polygon Retrieved:2020-3-29.
- In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple polygon. It is a special case of the more general concept of a convex hull. It can be computed in linear time, faster than algorithms for convex hulls of point sets.
The convex hull of a simple polygon can be subdivided into the given polygon itself and into polygonal pockets bounded by a polygonal chain of the polygon together with a single convex hull edge. Repeatedly reflecting an arbitrarily chosen pocket across this convex hull edge produces a sequence of larger simple polygons; according to the Erdős–Nagy theorem, this process eventually terminates with a convex polygon.
- In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple polygon. It is a special case of the more general concept of a convex hull. It can be computed in linear time, faster than algorithms for convex hulls of point sets.