scientific article; zbMATH DE number 7238963
From MaRDI portal
DOI10.4230/LIPIcs.SWAT.2018.8zbMath1477.68458MaRDI QIDQ5116471
No author found.
Publication date: 25 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Axiomatic and generalized convexity (52A01)
Cites Work
- The geodesic diameter of polygonal domains
- Querying two boundary points for shortest paths in a polygonal domain
- Geodesic order types
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- Geodesic ham-sandwich cuts
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Minimum-link paths among obstacles in the plane
- Almost tight upper bounds for lower envelopes in higher dimensions
- Optimal shortest path queries in a simple polygon
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- The complexity of computing minimum separating polygons
- Matrix Searching with the Shortest-Path Metric
- On the geodesic centers of polygonal domains
- Translating polygons with applications to hidden surface removal
- Detecting Weakly Simple Polygons
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
