GEODESIC-PRESERVING POLYGON SIMPLIFICATION
From MaRDI portal
Publication:5261017
DOI10.1142/S0218195914600097zbMath1331.68239arXiv1309.3858MaRDI QIDQ5261017
Alexander Pilz, Birgit Vogtenhuber, Oswin Aichholzer, Thomas Hackl, Matias Korman
Publication date: 1 July 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3858
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Piercing pairwise intersecting geodesic disks ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon ⋮ Polygon simplification by minimizing convex corners
Cites Work
- Geodesic order types
- A generalized Winternitz theorem
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On-line construction of the convex hull of a simple polyline
- Triangulations, visibility graph and reflex vertices of a simple polygon
- Triangulating a simple polygon in linear time
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- The furthest-site geodesic Voronoi diagram
- Computing minimum length paths of a given homotopy class
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- On minimum-area hulls
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Optimal shortest path queries in a simple polygon
- Extreme point and halving edge search in abstract order types
- Minimum-link paths revisited
- Constructing pairwise disjoint paths with few links
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
