The following pages link to THE VISIBILITY COMPLEX (Q5687651):
Displayed 18 items.
- On the complexity of sets of free lines and line segments among balls in three dimensions (Q420577) (← links)
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- Pointed drawings of planar graphs (Q452448) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- The visibility-Voronoi complex and its applications (Q870429) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- The vertex-edge visibility graph of a polygon (Q1388137) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Visibility Testing and Counting (Q3004687) (← links)
- MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK (Q3016229) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)