Orthogonal polygon reconstruction from stabbing information
From MaRDI portal
Publication:1614070
DOI10.1016/S0925-7721(01)00068-2zbMath1001.65019MaRDI QIDQ1614070
Publication date: 3 September 2002
Published in: Computational Geometry (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (6)
An improved algorithm for reconstructing a simple polygon from its visibility angles ⋮ A polygon is determined by its angles ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ Covering points with orthogonally convex polygons ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length
Cites Work
- Unnamed Item
- A unified approach to visibility representations of planar graphs
- Stabbing information of a simple polygon
- The vertex-edge visibility graph of a polygon
- Cross-ratios and angles determine a polygon
- Negative results on characterizing visibility graphs
- Traditional Galleries Require Fewer Watchmen
- POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
This page was built for publication: Orthogonal polygon reconstruction from stabbing information
