The following pages link to Visibility of disjoint polygons (Q1087340):
Displayed 47 items.
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Using Gale transforms in computational geometry (Q805285) (← links)
- The complexity of planar compliant motion planning under uncertainty (Q911278) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- A tight lower bound on the size of visibility graphs (Q1098639) (← links)
- On multiple moving objects (Q1102134) (← links)
- Shortest path between two simple polygons (Q1107993) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- An efficient algorithm for one-step planar compliant motion planning with uncertainty (Q1194343) (← links)
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- Upper envelope onion peeling (Q1199830) (← links)
- Planning a time-minimal motion among moving obstacles (Q1261288) (← links)
- A fast algorithm for computing sparse visibility graphs (Q1262133) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- An exact geometry-based algorithm for path planning (Q1797878) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Minimal tangent visibility graphs (Q1924714) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Shortest paths among transient obstacles (Q2156288) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
- A Computational Geometric Approach to Visual Hulls (Q4513219) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- The visibility diagram: A data structure for visibility problems and motion planning (Q5056095) (← links)
- Upper envelope onion peeling (Q5056118) (← links)
- (Q5111738) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)