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):
Displaying 50 items.
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← 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)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Shortest watchman routes in simple polygons (Q751818) (← links)
- Shortest polygonal paths in space (Q756442) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- A 2-approximation algorithm for the zookeeper's problem (Q845863) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Shortest path planning for a tethered robot (Q904114) (← 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)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- An approximative solution to the Zookeeper's problem (Q1014446) (← 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)
