Reconstructing polygons from scanner data

DOI10.1016/j.tcs.2010.10.026zbMath1217.68227DBLPjournals/tcs/BiedlDS11OpenAlexW2027854745WikidataQ56970195 ScholiaQ56970195MaRDI QIDQ553352

Stephane Durocher, Therese C. Biedl, Jack Scott Snoeyink

Publication date: 27 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.026

zbMATH Keywords

coveringpolygonreconstruction

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Minimum rectilinear polygons for given angle sequences ⋮ Covering points with minimum/maximum area orthogonally convex polygons ⋮ Reconstruction of Weakly Simple Polygons from Their Edges ⋮ Minimum Rectilinear Polygons for Given Angle Sequences ⋮ An improved algorithm for reconstructing a simple polygon from its visibility angles ⋮ On representing a simple polygon perceivable to a blind person ⋮ Area bounds of rectilinear polygons realized by angle sequences

Uses Software

• Powercrust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• The complexity of detecting crossingfree configurations in the plane
• Closed object boundaries from scattered points
• Surface reconstruction by Voronoi filtering
• Generating random polygons with given vertices
• Covering oriented points in the plane with orthogonal polygons is NP-complete
• Curve and Surface Reconstruction
• Reconstructing Polygons from Scanner Data
• Linear Programming in Linear Time When the Dimension Is Fixed
• Hamilton Paths in Grid Graphs
• Paths, Trees, and Flowers
• The power crust, unions of balls, and the medial axis transform

This page was built for publication: Reconstructing polygons from scanner data