On simple polygonalizations with optimal area
From MaRDI portal
Publication:1961852
DOI10.1007/PL00009492zbMath0948.68128MaRDI QIDQ1961852
Publication date: 13 November 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Continuity properties of mappings on manifolds (58C07) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Related Items (16)
Optimal area polygonization problems: exact solutions through geometric duality ⋮ On polygons excluding point sets ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ \(\alpha\)-concave hull, a generalization of convex hull ⋮ Greedy and Local Search Heuristics to Build Area-Optimal Polygons ⋮ Area Optimal Polygonization Using Simulated Annealing ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Computing Area-Optimal Simple Polygonizations ⋮ Unnamed Item ⋮ Spiral Serpentine Polygonization of a Planar Point Set ⋮ A Bound on a Convexity Measure for Point Sets ⋮ On separating points by lines ⋮ On the effectiveness of the genetic paradigm for polygonization ⋮ Minimizing the stabbing number of matchings, trees, and triangulations ⋮ On polygons enclosing point sets. II ⋮ An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
This page was built for publication: On simple polygonalizations with optimal area
