Pages that link to "Item:Q3982713"
From MaRDI portal
The following pages link to An Output-Sensitive Algorithm for Computing Visibility Graphs (Q3982713):
Displaying 50 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- Fastest-path planning for direction-dependent speed functions (Q368729) (← links)
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field (Q450535) (← links)
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- The visibility-Voronoi complex and its applications (Q870429) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- The vertex-edge visibility graph of a polygon (Q1388137) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559) (← links)
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- Finding exact solutions for the geometric firefighter problem in practice (Q1652708) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- A visibility graph averaging aggregation operator (Q1782722) (← links)
- Continuous visible query for three-dimensional objects in spatial databases (Q1793439) (← links)
- An exact geometry-based algorithm for path planning (Q1797878) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Minimal tangent visibility graphs (Q1924714) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Weighted minimum backward Fréchet distance (Q2317859) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Weak visibility counting in simple polygons (Q2351072) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (Q2817863) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Visibility Testing and Counting (Q3004687) (← links)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Density-Based Clustering Based on Topological Properties of the Data Set (Q3628367) (← links)
- A Computational Geometric Approach to Visual Hulls (Q4513219) (← links)
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS (Q4818564) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4961754) (← links)
