Pages that link to "Item:Q1101226"
From MaRDI portal
The following pages link to Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226):
Displayed 50 items.
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- LR-visibility in polygons (Q676582) (← links)
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Shortest watchman routes in simple polygons (Q751818) (← links)
- Shortest polygonal paths in space (Q756442) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- Towards a definition of higher order constrained Delaunay triangulations (Q1005329) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← 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)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Search for shortest path around semialgebraic obstacles in the plane (Q1190959) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- Special subgraphs of weighted visibility graphs (Q1199937) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- An algorithm for recognizing palm polygons (Q1345480) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- The vertex-edge visibility graph of a polygon (Q1388137) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559) (← links)
- Shortest zookeeper's routes in simple polygons (Q1607077) (← links)