Routing among convex polygonal obstacles in the plane
From MaRDI portal
(Redirected from Publication:6610091)
Recommendations
Cites work
- \(\pi /2\)-angle Xao graphs are spanners
- A trade-off between space and efficiency for routing tables
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Approximate distance oracles
- Close to linear space routing schemes
- Compact and low delay routing labeling scheme for unit disk graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Compact routing schemes with improved stretch
- Compact routing schemes with low stretch factor
- Compact routing with minimum stretch
- Competitive local routing with constraints
- Competitive online routing in geometric graphs
- Computational geometry. Algorithms and applications.
- Computing a minimum-dilation spanning tree is NP-hard
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Efficient computation of geodesic shortest paths
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- Geometric Spanner Networks
- scientific article; zbMATH DE number 1305410 (Why is no real title available?)
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 910885 (Why is no real title available?)
- scientific article; zbMATH DE number 7650244 (Why is no real title available?)
- Improved routing strategies with succinct tables
- Labelling and Implicit Routing in Networks
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- New and improved spanning ratios for Yao graphs
- New routing techniques and their applications
- On approximate distance labels and routing schemes with affine stretch
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On plane geometric spanners: a survey and open problems
- On Shortest Paths in Polyhedral Spaces
- On Spanners of Geometric Graphs
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Planar rectilinear shortest path computation using corridors
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Routing on the visibility graph
- Scale-free compact routing schemes in networks of low doubling dimension
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Shortest paths in the plane with polygonal obstacles
- Towards tight bounds on theta-graphs: more is not always better
- TRIANGULATING DISJOINT JORDAN CHAINS
- Visibility Algorithms in the Plane
- Visibility and ray shooting queries in polygonal domains
- Visibility of disjoint polygons
- Yao graphs span theta graphs
Cited in
(3)
This page was built for publication: Routing among convex polygonal obstacles in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610091)
