Pages that link to "Item:Q1062764"
From MaRDI portal
The following pages link to Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764):
Displaying 50 items.
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Time and space efficient algorithms for shortest paths between convex polygons (Q1098634) (← links)
- A tight lower bound on the size of visibility graphs (Q1098639) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- Obstacle growing in a nonpolygonal world (Q1107992) (← links)
- Shortest path between two simple polygons (Q1107993) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- A tight lower bound for the complexity of path-planning for a disc (Q1111039) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← 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)
- Search for shortest path around semialgebraic obstacles in the plane (Q1190959) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- Planning a time-minimal motion among moving obstacles (Q1261288) (← links)
- A fast algorithm for computing sparse visibility graphs (Q1262133) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- On fast planning of suboptimal paths amidst polygonal obstacles in plane (Q1367531) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- An exact geometry-based algorithm for path planning (Q1797878) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- There are planar graphs almost as good as the complete graph (Q1823959) (← links)
- On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) (← 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)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Solving visibility problems on MCCs of smaller size (Q2638829) (← links)
- Density-Based Clustering Based on Topological Properties of the Data Set (Q3628367) (← links)
- Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← 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)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- (Q5116471) (← links)
