Emanation graph: a plane geometric spanner with Steiner points
From MaRDI portal
Publication:2698543
DOI10.1007/S00373-023-02632-0OpenAlexW3160796411MaRDI QIDQ2698543FDOQ2698543
Authors: Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal 
Publication date: 24 April 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.10376
Recommendations
Cites Work
- Computational geometry. Algorithms and applications.
- There are planar graphs almost as good as the complete graph
- Planar spanners and approximate shortest path queries among obstacles in the plane
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Delaunay graphs are almost as good as complete graphs
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Classes of graphs which approximate the complete Euclidean graph
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- Plane Spanners of Maximum Degree Six
- On plane geometric spanners: a survey and open problems
- \(\pi /2\)-angle Xao graphs are spanners
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
- Constructing plane spanners of bounded degree and low weight
- On the stretch factor of the theta-4 graph
- Title not available (Why is that?)
- The stretch factor of the Delaunay triangulation is less than 1.998
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations
- Increasing-chord graphs on point sets
- New and improved spanning ratios for Yao graphs
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Graph Drawing
- Lower bounds on the dilation of plane spanners
- The \(\varTheta_5\)-graph is a spanner
- GraphMaps: browsing large graphs as interactive maps
- On the spanning and routing ratio of Theta-Four
- Improved bounds on the spanning ratio of the theta-5-graph
- Towards tight bounds on theta-graphs: more is not always better
- Construction and local routing for angle-monotone graphs
- Yao graphs span theta graphs
- There are plane spanners of degree 4 and moderate stretch factor
- A faster algorithm for computing straight skeletons
- Degree four plane spanners: simpler and better
- Improved bounds on the stretch factor of \(Y_{4}\)
- Spanning properties of Yao and \(\theta\)-graphs in the presence of constraints
- Simplified emanation graphs: a sparse plane spanner with Steiner points
Cited In (1)
Uses Software
This page was built for publication: Emanation graph: a plane geometric spanner with Steiner points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698543)
