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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Filling Holes In Complex Surfaces Using Volumetric Diffusion (2001)

Cached

  • Download as a PDF

Download Links

  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [www-hci.stanford.edu]
  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [www-hci.stanford.edu]
  • [graphics.stanford.edu]
  • [www.inf.uni-konstanz.de]
  • [www.cs.jhu.edu]
  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [www.cs.jhu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Steve Marschner , James Davis , Matt Garr , Marc Levoy
Citations:172 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Marschner01fillingholes,
    author = {Steve Marschner and James Davis and Matt Garr and Marc Levoy},
    title = {Filling Holes In Complex Surfaces Using Volumetric Diffusion},
    year = {2001}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We address the problem of building watertight 3D models from surfaces that contain holes---for example, sets of range scans that observe most but not all of a surface. We specifically address situations in which the holes are too geometrically and topologically complex to fill using triangulation algorithms. Our solution begins by constructing a signed distance function, the zero set of which defines the surface. Initially, this function is defined only in the vicinity of observed surfaces. We then apply a diffusion process to extend this function through the volume until its zero set bridges whatever holes may be present. If additional information is available, such as known-empty regions of space inferred from the lines of sight to a 3D scanner, it can be incorporated into the diffusion process. Our algorithm is simple to implement, is guaranteed to produce manifold non-interpenetrating surfaces, and is efficient to run on large datasets because computation is limited to areas near holes. By showing results for complex range scans, we demonstrate that our algorithm produces hole-free surfaces that are plausible, visually acceptable, and usually close to the intended geometry.

Keyphrases

complex surface using volumetric diffusion    diffusion process    triangulation algorithm    distance function    observed surface    range scan    complex range scan    manifold non-interpenetrating surface    zero set    large datasets    known-empty region    hole-free surface    additional information   

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