An empirical study on randomized optimal area polygonization of planar point sets
DOI10.1145/2896849zbMATH Open1365.68448OpenAlexW2338207953WikidataQ130960653 ScholiaQ130960653MaRDI QIDQ5266598FDOQ5266598
Jiju Peethambaran, Amal Dev Parakkat, Ramanathan Muthuganapathy
Publication date: 16 June 2017
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2896849
Recommendations
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Computational geometry. Algorithms and applications.
- Computational Geometry in C
- Finding Extremal Polygons
- Finding minimum area \(k\)-gons
- Boundaries through Scattered Points of Unknown Density
- Generating random polygons with given vertices
- Polygonizations of point sets in the plane
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
- On simple polygonalizations with optimal area
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Cited In (10)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons
- Computing Area-Optimal Simple Polygonizations
- On maximum area polygons in a planar point set
- On the effectiveness of the genetic paradigm for polygonization
- Title not available (Why is that?)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
- Optimal area polygonization problems: exact solutions through geometric duality
- Title not available (Why is that?)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
Uses Software
This page was built for publication: An empirical study on randomized optimal area polygonization of planar point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266598)
