de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A composite approach to meshing scattered data

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45141

Ohtake,  Yutaka
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44112

Belyaev,  Alexander
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45449

Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Ohtake, Y., Belyaev, A., & Seidel, H.-P. (2006). A composite approach to meshing scattered data. Graphical Models, 68, 255-267.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-21CE-B
Abstract
In this paper, we propose a new method for approximating an unorganized set of points scattered over a piecewise smooth surface by a triangle mesh. The method is based on the Garland-Heckbert local quadric error minimization strategy. First an adaptive spherical cover and auxiliary points corresponding to the cover elements are generated. Then the intersections between the spheres of the cover are analyzed and the auxiliary points are connected. Finally the resulting mesh is cleaned from nonmanifold parts. The method allows us to control the approximation accuracy, process noisy data, and reconstruct sharp edges and corners. Further, the vast majority of the triangles of the generated mesh have their aspect ratios close to optimal. Thus our approach integrates the mesh reconstruction, smoothing, decimation, feature restoration, and remeshing stages together.