Area-Optimal Simple Polygonalizations: The CG Challenge 2019
From MaRDI portal
Publication:5102073
DOI10.1145/3504000OpenAlexW3212913259WikidataQ114071090 ScholiaQ114071090MaRDI QIDQ5102073
Erik D. Demaine, Joseph S. B. Mitchell, Dominik Krupke, Phillip Keldenich, Sndor P. Fekete
Publication date: 6 September 2022
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07304
computational geometrygeometric optimizationexact algorithmsalgorithm engineeringpolygonizationarea optimization
Related Items
Optimal area polygonization problems: exact solutions through geometric duality ⋮ Computing Area-Optimal Simple Polygonizations ⋮ Optimal Area Polygonization by Triangulation and Visibility Search ⋮ Unnamed Item ⋮ Clique-width of point configurations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved upper bounds on the reflexivity of point sets
- The boundary characteristic and Pick's theorem in the Archimedean planar tilings
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Enumerating order types for small point sets with applications
- Separation and approximation of polyhedral objects
- Generating random polygons with given vertices
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- On simple polygonalizations with optimal area
- On the Volume of Lattice Polyhedra
- TSPLIB—A Traveling Salesman Problem Library
- Triangulations and Pick's Theorem
- Computational Geometry in C
- From Euler's Formula to Pick's Formula Using an Edge Theorem
- 2-Opt Moves and Flips for Area-optimal Polygonizations
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons
- Area Optimal Polygonization Using Simulated Annealing
- Computing Area-Optimal Simple Polygonizations
- Triangle-Based Heuristics for Area Optimal Polygonizations
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
- Lattice Points and Polygonal Area
- Computing nonsimple polygons of minimum perimeter
- Optimal Area Polygonization by Triangulation and Visibility Search
