Optimal Area Polygonization by Triangulation and Visibility Search

DOI10.1145/3503953zbMATH Open1521.68238MaRDI QIDQ6163583FDOQ6163583

Authors: Julien Lepagnot, Laurent Moalic, Dominique Schmitt 

Publication date: 26 June 2023

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Recommendations

• 2-opt moves and flips for area-optimal polygonizations
• Area-optimal simple polygonalizations: the CG challenge 2019
• Computing area-optimal simple polygonizations
• Triangle-Based Heuristics for Area Optimal Polygonizations
• Area optimal polygonization using simulated annealing

zbMATH Keywords

computational geometrygeometric optimizationalgorithm engineeringpolygonalizationarea optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• Triangulating a simple polygon in linear time
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Title not available (Why is that?)
• The traveling salesman. Computational solutions for RSP applications
• Computational Geometry in C
• Visibility Algorithms in the Plane
• Flips in planar graphs
• Generalized Delaunay triangulation for planar graphs
• Corrections to Lee's visibility polygon algorithm
• A linear algorithm for computing the visibility polygon from a point
• Visibility of a simple polygon
• FIST: fast industrial-strength triangulation of polygons
• Area optimal polygonization using simulated annealing
• On-line construction of the convex hull of a simple polyline
• Dynamic algorithms for visibility polygons in simple polygons
• Computing area-optimal simple polygonizations
• Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
• Maintaining the visibility graph of a dynamic simple polygon
• Triangle-Based Heuristics for Area Optimal Polygonizations
• 2-opt moves and flips for area-optimal polygonizations
• Greedy and local search heuristics to build area-optimal polygons
• Area-optimal simple polygonalizations: the CG challenge 2019

Cited In (6)

• Edge sparsification for geometric tour problems
• 2-opt moves and flips for area-optimal polygonizations
• Area-optimal simple polygonalizations: the CG challenge 2019
• Combinatorial Geometry and Graph Theory
• Triangle-Based Heuristics for Area Optimal Polygonizations
• Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)

This page was built for publication: Optimal Area Polygonization by Triangulation and Visibility Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163583)