scientific article; zbMATH DE number 7561700
From MaRDI portal
Publication:5092418
DOI10.4230/LIPIcs.MFCS.2019.56MaRDI QIDQ5092418
Adrian Dumitrescu, Ke Chen, Wolfgang Mulzer, Csaba D. Tóth
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- Constructing plane spanners of bounded degree and low weight
- On the dilation spectrum of paths, cycles, and trees
- Computing a minimum-dilation spanning tree is NP-hard
- On Steiner trees for bounded point sets
- Unsolved problems in geometry
- Beta-skeletons have unbounded dilation
- Minimum rectilinear Steiner tree of \(n\) points in the unit square
- Geometric applications of a randomized optimization technique
- Multilevel polynomial partitions and simplified range searching
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Local Versus Global Properties of Metric Spaces
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Research Problems in Discrete Geometry
- The shortest path and the shortest road through n points
- Geometric Spanner Networks
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Self-approaching curves
- Curves with increasing chords
- Approximating the Stretch Factor of Euclidean Graphs
- Self-approaching paths in simple polygons
- How Long Can a Euclidean Traveling Salesman Tour Be?
- Self-approaching Graphs
- On Range Searching with Semialgebraic Sets. II
- Steiner Minimal Trees
- On the Shortest Path Through a Number of Points
- Generalized self-approaching curves
