Pages that link to "Item:Q4595512"

The following pages link to Planar spanners and approximate shortest path queries among obstacles in the plane (Q4595512):

Displaying 29 items.

• On approximating tree spanners that are breadth first search trees (Q269500) (← links)
• On plane geometric spanners: a survey and open problems (Q359741) (← links)
• Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
• Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
• Planar rectilinear shortest path computation using corridors (Q833714) (← links)
• Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
• Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
• I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
• Tree spanners of bounded degree graphs (Q1693164) (← links)
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
• Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
• A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
• Reachability oracles for directed transmission graphs (Q2309470) (← links)
• On path-greedy geometric spanners (Q2678257) (← links)
• Emanation graph: a plane geometric spanner with Steiner points (Q2698543) (← links)
• Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
• (Q5091049) (← links)
• (Q5092347) (← links)
• (Q5115792) (← links)
• Shortest-path queries in static networks (Q5176178) (← links)
• (Q5743390) (← links)
• Many distances in planar graphs (Q5920250) (← links)
• Tree spanners in planar graphs (Q5928870) (← links)
• Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
• Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
• Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
• (Q6179341) (← links)
• Routing among convex polygonal obstacles in the plane (Q6610091) (← links)