Routing among convex polygonal obstacles in the plane
From MaRDI portal
Publication:6610091
DOI10.1142/s0129054123410034zbMATH Open1547.05065MaRDI QIDQ6610091
Rajasekhar Inkulu, Pawan Kumar
Publication date: 24 September 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Applications of graph theory (05C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- Compact and low delay routing labeling scheme for unit disk graphs
- Planar rectilinear shortest path computation using corridors
- Towards tight bounds on theta-graphs: more is not always better
- Computing a minimum-dilation spanning tree is NP-hard
- 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
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Routing in unit disk graphs
- Competitive online routing in geometric graphs
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Visibility and ray shooting queries in polygonal domains
- Compact Routing with Minimum Stretch
- New Routing Techniques and their Applications
- Efficient computation of geodesic shortest paths
- 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
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- 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
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- Planar spanners and approximate shortest path queries among obstacles in the plane
- π/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
- Visibility Algorithms in the Plane
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- On Spanners of Geometric Graphs
- Constrained routing between non-visible vertices
- Close to linear space routing schemes
This page was built for publication: Routing among convex polygonal obstacles in the plane