Pages that link to "Item:Q1823689"
From MaRDI portal
The following pages link to Optimal shortest path queries in a simple polygon (Q1823689):
Displayed 30 items.
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← 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)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← 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)
- 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)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← 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)
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS (Q4818559) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)