Minimum dilation stars
From MaRDI portal
Publication:871060
Recommendations
Cites Work
- scientific article; zbMATH DE number 2086390 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- scientific article; zbMATH DE number 6469174 (Why is no real title available?)
- 2-point site Voronoi diagrams
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Approximating the Stretch Factor of Euclidean Graphs
- Efficient randomized algorithms for some geometric optimization problems
- Optimal Point Placement for Mesh Smoothing
Cited In (14)
- On the dilation spectrum of paths, cycles, and trees
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
- Dilation-optimal edge deletion in polygonal cycles
- Minimum dilation stars
- Most finite point sets in the plane have dilation \(>1\)
- Approximate weighted farthest neighbors and minimum dilation stars
- Optimal algorithms for geometric centers and depth
- Eutactic star closest to a given star
- Testing Euclidean Spanners
- Computing geometric minimum-dilation graphs is NP-hard
- Optimal Embedding into Star Metrics
- Inhomogeneous minima of star bodies
- Approximate weighted farthest neighbors and minimum dilation stars
- Distribution-sensitive construction of the greedy spanner
This page was built for publication: Minimum dilation stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871060)