Title: Efficient Reconstruction From Scattered Points
Authors: Bíscaro, Helton Hideraldo
Citation: WSCG 2010: Communication Papers Proceedings: 18th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS, p. 153-160.
Issue Date: 2010
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2010/Papers_2010/!_2010_Short-proceedings.pdf
ISBN: 978-80-86943-87-9
Keywords: rekonstrukce povrchu;rigidní pohyby;3D struktury;Delaunayova triangulace
Keywords in different language: surface reconstruction;rigid movements;3D structures;Delaunay triangulation
Abstract: Most algorithms that reconstruct surface from sample points rely on computationally demanding operations to derive the reconstruction, beside this, most of the classical algorithm use a kind of three-dimensional structure to derive a two-dimensional one. In this paper we introduce an innovative approach for generating two-dimensional piecewise linear approximations from sample points in R3 that simplify significantly the numerical calculation and the memory usage in the reconstruction process. The approach proposed here is an advancing front approach that uses rigid movements in the three-dimensional space and a bidimensional Delaunay triangulation as the main tools for the algorithm. The principal idea is to use a combination of rotations and translations in order to simplify the calculations and avoid the three-dimensional structure used by the most of the algorithms. Avoiding those structures, this approach can reduce the computational cost and numerical instabilities typically associated with the classical algorithm reconstructions.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG 2010: Communication Papers Proceedings

Files in This Item:
File Description SizeFormat 
Biscaro.pdfPlný text1,46 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11055

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.