• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A New Voronoi-Based Surface Reconstruction Algorithm (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.princeton.edu:80]
  • [www.cs.princeton.edu]
  • [www.cs.ucdavis.edu]
  • [http.cs.berkeley.edu]
  • [www.cs.utexas.edu]
  • [compbio.mit.edu]
  • [web.mit.edu]
  • [www.ai.mit.edu]
  • [mit.edu]
  • [compbio.mit.edu]
  • [web.mit.edu]
  • [mit.edu]
  • [web.mit.edu]
  • [web.mit.edu]
  • [web.mit.edu]
  • [kogs-www.informatik.uni-hamburg.de]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Nina Amenta , Marshall Bern , Manolis Kamvysselis
Citations:414 - 9 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Amenta02anew,
    author = {Nina Amenta and Marshall Bern and Manolis Kamvysselis},
    title = {A New Voronoi-Based Surface Reconstruction Algorithm },
    year = {2002}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in R³. The algorithm is the first for this problem with provable guarantees. Given a “good sample” from a smooth surface, the output is guaranteed to be topologically correct and convergent to the original surface as the sampling density increases. The definition of a good sample is itself interesting: the required sampling density varies locally, rigorously capturing the intuitive notion that featureless areas can be reconstructed from fewer samples. The output mesh interpolates, rather than approximates, the input points. Our algorithm is based on the three-dimensional Voronoi diagram. Given a good program for this fundamental subroutine, the algorithm is quite easy to implement.

Keyphrases

new voronoi-based surface reconstruction algorithm    good sample    new algorithm    provable guarantee    output mesh interpolates    good program    density increase    original surface    intuitive notion    fundamental subroutine    smooth surface    three-dimensional voronoi diagram    required sampling density varies    unorganized sample point    featureless area    input point   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University