Pages that link to "Item:Q1823689"
From MaRDI portal
The following pages link to Optimal shortest path queries in a simple polygon (Q1823689):
Displaying 38 items.
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- Approximate Shortest Path Queries Using Voronoi Duals (Q3052756) (← links)
- Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- Digital Deformable Model Simulating Active Contours (Q3648785) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198) (← links)
- (Q4763413) (← links)
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS (Q4818559) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- (Q5088992) (← links)
- Partially Walking a Polygon (Q5091053) (← links)
- (Q5115770) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- (Q5116471) (← links)
- (Q5116518) (← links)
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains (Q5120154) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- Shortest Path in a Polygon using Sublinear Space. (Q5368680) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- Away from each other (Q6091146) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
- Large \(k\)-gons in a 1.5D terrain (Q6168930) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
- k-pairs non-crossing shortest paths in a simple polygon (Q6487450) (← links)
- Uniformly monotone partitioning of polygons (Q6593668) (← links)
- On flipping the Fréchet distance (Q6647773) (← links)
