Pages that link to "Item:Q1823689"
From MaRDI portal
The following pages link to Optimal shortest path queries in a simple polygon (Q1823689):
Displaying 50 items.
- The geodesic diameter of polygonal domains (Q368771) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Shortest path planning for a tethered robot (Q904114) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- A new data structure for shortest path queries in a simple polygon (Q1178232) (← links)
- Special subgraphs of weighted visibility graphs (Q1199937) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- Computing simple paths from given points inside a polygon (Q1630775) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Piercing pairwise intersecting geodesic disks by five points (Q2096392) (← links)
- The polygon burning problem (Q2154090) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Largest triangle inside a terrain (Q2222094) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- The discrete Voronoi game in a simple polygon (Q2326396) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- Partially walking a polygon (Q2331219) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
