Pages that link to "Item:Q1114399"
From MaRDI portal
The following pages link to An optimal visibility graph algorithm for triangulated simple polygons (Q1114399):
Displaying 32 items.
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- A new data structure for shortest path queries in a simple polygon (Q1178232) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- An algorithm for recognizing palm polygons (Q1345480) (← links)
- The vertex-edge visibility graph of a polygon (Q1388137) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Quasi-Monte-Carlo methods and the dispersion of point sequences (Q1921094) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Two-Guard Walkability of Simple Polygons (Q4513202) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)
- One-sided terrain guarding and chordal graphs (Q6204302) (← links)
