DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES
From MaRDI portal
Publication:5305064
DOI10.1142/S0218195910003207zbMath1192.65073MaRDI QIDQ5305064
No author found.
Publication date: 19 March 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Distance in graphs (05C12) Density (toughness, etc.) (05C42)
Cites Work
- Minimum dilation stars
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Computing a minimum-dilation spanning tree is NP-hard
- A sweepline algorithm for Voronoi diagrams
- The all nearest-neighbor problem for convex polygons
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Geometric Spanner Networks
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Optimal Point Location in a Monotone Subdivision
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Optimal Search in Planar Subdivisions
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
- 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
