Dilation-Optimal Edge Deletion in Polygonal Cycles
From MaRDI portal
Publication:5387748
DOI10.1007/978-3-540-77120-3_10zbMath1193.68262MaRDI QIDQ5387748
No author found.
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_10
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
68W20: Randomized algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A sweepline algorithm for Voronoi diagrams
- The all nearest-neighbor problem for convex polygons
- Geometric Spanner Networks
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Optimal Search in Planar Subdivisions
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Approximating the Stretch Factor of Euclidean Graphs
- SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM