POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION

DOI10.1142/S0218195900000115MaRDI QIDQ4682195zbMATH OpenOpenAlexFDO

Authors S. 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

order typesreconstructionVisibility graph

Mathematics Subject Classification ID

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

Recommendations

• Orthogonal polygon reconstruction from stabbing information
• Reconstructing visible regions from visible segments
• Reconstructing generalized staircase polygons with uniform step length

Cites work

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

Cited in

(10)

• Reconstructing visible regions from visible segments
• Orthogonal polygon reconstruction from stabbing information
• Order on order types
• Area requirement of visibility representations of trees
• Reconstructing point set order types from radial orderings
• Reconstructing Point Set Order Types from Radial Orderings
• Reconstructing generalized staircase polygons with uniform step length
• An optimal algorithm for reconstructing point set order types from radial orderings
• Directed rectangle-visibility graphs have unbounded dimension
• Reconstructing sets of orthogonal line segments in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682195)