Routing among convex polygonal obstacles in the plane

DOI10.1007/978-3-030-92681-6_1MaRDI QIDQ2149846zbMATH OpenOpenAlexFDO

Authors Pawan Kumar, Rajasekhar Inkulu

Publication date 29 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92681-6_1

zbMATH Keywords

approximation algorithmscomputational geometryshortest paths

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Shortest paths in the plane with convex polygonal obstacles
• Shortest paths in the plane with polygonal obstacles
• Routing in polygonal domains
• Routing in polygonal domains
• Routing in polygons without rectilinearly visible corners
• An efficient algorithm for computing high-quality paths amid polygonal obstacles
• An efficient algorithm for computing high-quality paths amid polygonal obstacles
• Finding rectilinear least cost paths in the presence of convex polygonal congested regions
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane

Cites work

• 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.
• 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?)
• 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 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
• 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 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
• TRIANGULATING DISJOINT JORDAN CHAINS
• Visibility Algorithms in the Plane
• Visibility and ray shooting queries in polygonal domains
• Visibility of disjoint polygons

Cited in

(4)

• Algorithms for routing around a rectangle
• Routing in polygonal domains
• Routing among convex polygonal obstacles in the plane
• A divide-and-conquer based preprocessing for routing in a simple polygon

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 Q2149846)