[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1275808.1276431acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
Article

Interactive topology-aware surface reconstruction

Published: 29 July 2007 Publication History

Abstract

The reconstruction of a complete watertight model from scan data is still a difficult process. In particular, since scanned data is often incomplete, the reconstruction of the expected shape is an ill-posed problem. Techniques that reconstruct poorly-sampled areas without any user intervention fail in many cases to faithfully reconstruct the topology of the model. The method that we introduce in this paper is topology-aware: it uses minimal user input to make correct decisions at regions where the topology of the model cannot be automatically induced with a reasonable degree of confidence. We first construct a continuous function over a three-dimensional domain. This function is constructed by minimizing a penalty function combining the data points, user constraints, and a regularization term. The optimization problem is formulated in a mesh-independent manner, and mapped onto a specific mesh using the finite-element method. The zero level-set of this function is a first approximation of the reconstructed surface. At complex under-sampled regions, the constraints might be insufficient. Hence, we analyze the local topological stability of the zero level-set to detect weak regions of the surface. These regions are suggested to the user for adding local inside/outside constraints by merely scribbling over a 2D tablet. Each new user constraint modifies the minimization problem, which is solved incrementally. The process is repeated, converging to a topology-stable reconstruction. Reconstructions of models acquired by a structured-light scanner with a small number of scribbles demonstrate the effectiveness of the method.

Supplementary Material

JPG File (pps043.jpg)
MP4 File (pps043.mp4)

References

[1]
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., and Silva, C. 2001. Point set surfaces. In Visualization, IEEE, 21--28.
[2]
Amenta, N., and Kil, Y. J. 2004. Defining point-set surfaces. In Siggraph, ACM, 264--270.
[3]
Amenta, N., Bern, M. W., and Kamvysselis, M. K. 1998. Crust: A new Voronoï-based surface reconstruction algorithm. In Siggraph, ACM, 415--422.
[4]
Banchoff, T. 1967. Critical points and curvature for embedded polyhedra. Journal of Differential Geometry 1, 257--268.
[5]
Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., and Taubin, G. 1999. The Ball-Pivoting Algorithm for surface reconstruction. Transactions on Visualization and Computer Graphics 5, 4, 349--359.
[6]
Boissonnat, J.-D., and Cazals, F. 2002. Smooth surface reconstruction via natural neighbour interpolation of distance functions. Computational Geometry: Theory and Applications 22, 1--3, 185--203.
[7]
Carr, J., Beatson, R., Cherrie, J., Mitchell, T. J., Fright, W. R., McCallum, B. C., and Evans, T. R. 2001. Reconstruction and representation of 3D objects with radial basis functions. In Siggraph, ACM, 67--76.
[8]
Curless, B., and Levoy, M. 1996. A volumetric method for building complex models from range images. In Siggraph, ACM, 303--312.
[9]
Davis, T. A., and Hager, W. W. 2005. Row modifications of a sparse Cholesky factorization. SIAM Journal on Matrix Analysis and Applications 26, 3, 621--639.
[10]
Davis, J., Marschner, S., Garr, M., and Levoy, M. 2002. Filling holes in complex surfaces using volumetric diffusion. In Symposium on 3D Data Processing, Visualization, and Transmission, University of Padova.
[11]
Dey, T. K., and Goswami, S. 2004. Provable surface reconstruction from noisy samples. In Symposium on Computational Geometry, ACM, 330--339.
[12]
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., and Stuetzle, W. 1992. Surface reconstruction from unorganized points. In Siggraph, ACM, 71--78.
[13]
Hornung, A., and Kobbelt, L. 2006. Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information. In Symposium on Geometry Processing, ACM/Eurographics, 41--50.
[14]
Hughes, T. J. R. 1987. The Finite Element Method. Linear Static and Dynamic Finite Element Analysis. Prentice-Hall.
[15]
Kazhdan, M., Bolitho, M., and Hoppe, H. 2006. Poisson surface reconstruction. In Symposium on Geometry Processing, ACM/Eurographics, 61--70.
[16]
Kolluri, R., Shewchuk, J. R., and O'Brien, J. F. 2004. Spectral surface reconstruction from noisy point clouds. In Symposium on Geometry Processing, ACM Press, 11--21.
[17]
Levin, A., Lischinski, D., and Weiss, Y. 2004. Colorization using optimization. In Siggraph, ACM, 689--694.
[18]
Levoy, M., Pulli, K., Curless, B., Rusinkiewicz, S., Koller, D., Pereira, L., Ginzton, M., Anderson, S., Davis, J., Ginsberg, J., Shade, J., and Fulk, D. 2000. The digital Michelangelo project: 3D scanning of large statues. In Siggraph, ACM, 131--144.
[19]
Li, Y., Sun, J., Tang, C.-K., and Shum, H.-Y. 2004. Lazy snapping. Transaction on Graphics 23, 3, 303--308.
[20]
Milnor, J. W. 1963. Morse theory. Princeton University Press.
[21]
Nealen, A., Sorkine, O., Alexa, M., and Cohen-Or, D. 2005. A sketch-based interface for detail-preserving mesh editing. Transactions on Graphics 24, 3, 1142--1147.
[22]
Ni, X., Garland, M., and Hart, J. C. 2004. Fair Morse functions for extracting the topological structure of a surface mesh. In Siggraph, ACM, 613--622.
[23]
Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., and Sei-Del, H.-P. 2003. Multi-level partition of unity implicits. Transaction on Graphics 22, 3, 463--470.
[24]
Ohtake, Y., Belyaev, A., and Seidel, H.-P. 2004. A multi-scale approach to 3D scattered data approximation with adaptive compactly supported radial basis functions. In Solid Modeling International, IEEE, 31--39.
[25]
Schaefer, S., and Warren, J. 2004. Dual marching cubes: Primal contouring of dual grids. In Pacific Graphics, IEEE, 70--76.
[26]
Sharf, A., Lewiner, T., Shamir, A., Kobbelt, L., and Cohen-Or, D. 2006. Competing fronts for coarse-to-fine surface reconstruction. In Eurographics, Eurographics, 389--398.
[27]
Stander, B. T., and Hart, J. C. 1997. Guaranteeing the topology of an implicit surface polygonization for interactive modeling. In Siggraph, ACM, 279--286.
[28]
Strang, G. 1986. Introduction to Applied Mathematics. Wellesley-Cambridge.
[29]
Wang, J., and Cohen, M. F. 2005. An iterative optimization approach for unified image segmentation and matting. In ICCV, IEEE, 936--943.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGGRAPH '07: ACM SIGGRAPH 2007 papers
August 2007
1019 pages
ISBN:9781450378369
DOI:10.1145/1275808
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 July 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. interactive tools
  2. surface reconstruction

Qualifiers

  • Article

Conference

SIGGRAPH07
Sponsor:

Acceptance Rates

SIGGRAPH '07 Paper Acceptance Rate 108 of 455 submissions, 24%;
Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2019)Spectral coarsening of geometric operatorsACM Transactions on Graphics10.1145/3306346.332295338:4(1-13)Online publication date: 12-Jul-2019
  • (2016)Data-driven shape analysis and processingSIGGRAPH ASIA 2016 Courses10.1145/2988458.2988473(1-38)Online publication date: 28-Nov-2016
  • (2014)2D-D Lifting for Shape ReconstructionComputer Graphics Forum10.1111/cgf.1249333:7(249-258)Online publication date: 1-Oct-2014
  • (2013)Estimated topological surface for 3D reconstruction using variational schemeThe Imaging Science Journal10.1179/1743131X10Y.000000001159:4(232-237)Online publication date: 12-Nov-2013
  • (2010)Mesh Denoising Using Quadric Error MetricProceedings of the 2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images10.1109/SIBGRAPI.2010.41(247-254)Online publication date: 30-Aug-2010
  • (2010)Topology Aware Vector Field DenoisingProceedings of the 2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images10.1109/SIBGRAPI.2010.22(103-109)Online publication date: 30-Aug-2010
  • (2010)An algorithm of CUDA-based Poisson surface reconstruction2010 International Conference on Audio, Language and Image Processing10.1109/ICALIP.2010.5684972(203-207)Online publication date: Nov-2010
  • (2008)Space-time surface reconstruction using incompressible flowACM SIGGRAPH Asia 2008 papers10.1145/1457515.1409063(1-10)Online publication date: 10-Dec-2008
  • (2008)Space-time surface reconstruction using incompressible flowACM Transactions on Graphics10.1145/1409060.140906327:5(1-10)Online publication date: 1-Dec-2008
  • (2007)Regularized implicit surface reconstruction from points and normalsJournal of the Brazilian Computer Society10.1007/BF0319425313:4(7-15)Online publication date: Dec-2007

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media