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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Fitting Smooth Surfaces to Dense Polygon Meshes (1996)

Cached

  • Download as a PDF

Download Links

  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]
  • [www-hci.stanford.edu]
  • [graphics.stanford.edu]
  • [www.cs.jhu.edu]
  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Venkat Krishnamurthy , Marc Levoy
Venue:Proceedings of SIGGRAPH 96
Citations:240 - 5 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Krishnamurthy96fittingsmooth,
    author = {Venkat Krishnamurthy and Marc Levoy},
    title = {Fitting Smooth Surfaces to Dense Polygon Meshes},
    booktitle = {Proceedings of SIGGRAPH 96},
    year = {1996},
    pages = {313--324}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Recent progress in acquiring shape from range data permits the acquisition of seamless million-polygon meshes from physical models. In this paper, we present an algorithm and system for converting dense irregular polygon meshes of arbitrary topology into tensor product B-spline surface patches with accompanying displacement maps. This choice of representation yields a coarse but efficient model suitable for animation and a fine but more expensive model suitable for rendering. The first step in our process consists of interactively painting patch boundaries over a rendering of the mesh. In many applications, interactive placement of patch boundaries is considered part of the creative process and is not amenable to automation. The next step is gridded resampling of eachboundedsection of the mesh. Our resampling algorithm lays a grid of springs acrossthe polygonmesh, then iterates between relaxing this grid and subdividing it. This grid provides a parameterization for the mesh section, w...

Keyphrases

dense polygon mesh    smooth surface    patch boundary    interactive placement    spring acrossthe polygonmesh    range data    creative process    mesh section    dense irregular polygon mesh    first step    next step    efficient model    many application    physical model    expensive model    tensor product b-spline surface patch    displacement map    representation yield    recent progress    seamless million-polygon mesh    arbitrary topology   

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