THE VISIBILITY COMPLEX

DOI10.1142/S0218195996000204zbMath0860.68108OpenAlexW4247939603MaRDI QIDQ5687651

Michel Pocchiola, Gert Vegter

Publication date: 13 April 1997

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195996000204

zbMATH Keywords

visibility graphvisibility polygonvisibility complexpseudo- triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Visibility queries in a polygonal region ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ Space–Query-Time Tradeoff for Computing the Visibility Polygon ⋮ The visibility-Voronoi complex and its applications ⋮ The vertex-edge visibility graph of a polygon ⋮ On geometric path query problems ⋮ Randomized approximation algorithms for planar visibility counting problem ⋮ On the complexity of sets of free lines and line segments among balls in three dimensions ⋮ Trajectory planning for an articulated probe ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Pointed drawings of planar graphs ⋮ Visibility Testing and Counting ⋮ Query point visibility computation in polygons with holes ⋮ MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Enumerating pseudo-triangulations in the plane ⋮ Computing pseudotriangulations via branched coverings ⋮ An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem ⋮ Multitriangulations as complexes of star polygons ⋮ Empty pseudo-triangles in point sets ⋮ Quickest visibility queries in polygonal domains ⋮ VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME ⋮ Visibility testing and counting