POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION

DOI10.1142/S0218195900000115zbMath1074.68657OpenAlexW2145427355MaRDI QIDQ4682195

Stephen K. Wismath

Publication date: 10 June 2005

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

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

zbMATH Keywords

reconstructionorder typesVisibility graph

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Orthogonal polygon reconstruction from stabbing information ⋮ Area requirement of visibility representations of trees ⋮ An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings ⋮ Order on order types ⋮ Reconstructing Point Set Order Typesfrom Radial Orderings ⋮ Reconstructing Point Set Order Types from Radial Orderings ⋮ Directed rectangle-visibility graphs have unbounded dimension

Cites Work

• A unified approach to visibility representations of planar graphs
• The compression theorem III: Applications
• Multidimensional Sorting
• Recognizing visibility graphs of spiral polygons
• Constructing Arrangements of Lines and Hyperplanes with Applications

This page was built for publication: POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION