Routing in polygonal domains
DOI10.1016/j.comgeo.2019.101593zbMath1433.68276OpenAlexW2983251291MaRDI QIDQ2173455
Wolfgang Mulzer, Birgit Vogtenhuber, Max Willert, Bahareh Banyassady, Man-Kwun Chiu, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Matias Korman
Publication date: 22 April 2020
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2019.101593
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- Compact and low delay routing labeling scheme for unit disk graphs
- Towards tight bounds on theta-graphs: more is not always better
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Visibility of disjoint polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A new algorithm for shortest paths among obstacles in the plane
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Routing in unit disk graphs
- Competitive online routing in geometric graphs
- The \(\varTheta_5\)-graph is a spanner
- Improved bounds on the stretch factor of \(Y_{4}\)
- Compact Routing with Minimum Stretch
- New Routing Techniques and their Applications
- On the Stretch Factor of the Theta-4 Graph
- New and improved spanning ratios for Yao graphs
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- YAO GRAPHS SPAN THETA GRAPHS
- Improved routing strategies with succinct tables
- Labelling and Implicit Routing in Networks
- Geometric Spanner Networks
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
- Approximate distance oracles
- On Shortest Paths in Polyhedral Spaces
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Shortest paths in the plane with polygonal obstacles
- TRIANGULATING DISJOINT JORDAN CHAINS
- π/2-ANGLE YAO GRAPHS ARE SPANNERS
- A trade-off between space and efficiency for routing tables
- Compact routing schemes with low stretch factor
- Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension
- Routing on the visibility graph
- Compact routing schemes with improved stretch
- Compact oracles for reachability and approximate distances in planar digraphs
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Constrained routing between non-visible vertices
- Close to linear space routing schemes
This page was built for publication: Routing in polygonal domains
