Polygonizations of point sets in the plane

DOI10.1007/BF02187898zbMath0629.52008MaRDI QIDQ1093906

Linda L. Deneen, Gary M. Shute

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131037

zbMATH Keywords

algorithmscomplexitiesStar-shaped polygonizations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items

Onion polygonizations ⋮ Starshaped sets ⋮ On the Number of Radial Orderings of Colored Planar Point Sets ⋮ Spiral Serpentine Polygonization of a Planar Point Set ⋮ An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Computing simple circuits from a set of line segments
• Weighted and roughly weighted simple games
• A lower bound for the optimal crossing-free Hamiltonian cycle problem
• Finding the intersection of two convex polyhedra
• An efficient algorithm for determining the convex hull of a finite planar set
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Plane-sweep algorithms for intersecting geometric figures
• Convex hulls of finite sets of points in two and three dimensions
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters