Reconstructing Polygons from Scanner Data
From MaRDI portal
Publication:3652273
DOI10.1007/978-3-642-10631-6_87zbMath1273.68388OpenAlexW2136686792WikidataQ56970269 ScholiaQ56970269MaRDI QIDQ3652273
Jack Scott Snoeyink, Stephane Durocher, Therese C. Biedl
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://cdr.lib.unc.edu/downloads/6108vm33z
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
A polygon is determined by its angles ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Covering points with orthogonally convex polygons ⋮ Reconstructing polygons from scanner data
This page was built for publication: Reconstructing Polygons from Scanner Data