Article

Atomic volumes for mesh completion

Authors:

Joshua Podolak,

Szymon RusinkiewiczAuthors Info & Claims

SGP '05: Proceedings of the third Eurographics symposium on Geometry processing

Pages 33 - es

Published: 04 July 2005 Publication History

Abstract

The increased use of scanned geometry for applications in computer graphics and 3D hardcopy output has highlighted the need for general, robust algorithms for reconstruction of watertight 3D models given partial polygonal meshes as input. We present an algorithm for 3D hole filling based on a decomposition of space into atomic volumes, which are each determined to be either completely inside or completely outside the model. By defining the output model as the union of interior atomic volumes we guarantee that the resulting mesh is watertight. Individual volumes are labeled as "inside" or "outside" by computing a minimum-cost cut of a graph representation of the atomic volume structure, patching all the holes simultaneously in a globally sensitive manner. User control is provided to select between multiple topologically distinct, yet still valid, ways of filling holes. Finally, we use an octree decomposition of space to provide output-sensitive computation time. We demonstrate the ability of our algorithm to fill complex, non-planar holes in large meshes obtained from 3D scanning devices.

References

[1]

{ACK01} Amenta N., Choi S., Kolluri R. K.: The power crust, unions of balls, and the medial axis transform. Computational Geometry 19, 2-3 (2001), 127--153. 2

Digital Library

[2]

{BDE92} Bern M., Dobkin D., Eppstein D.: Triangulating polygons without large angles. In Proceedings of the eighth annual symposium on Computational geometry (1992), ACM Press, pp. 222--231. 5

Digital Library

[3]

{CL96} Curless B., Levoy M.: A volumetric method for building complex models from range images. In SIGGRAPH '96: Proceedings of the 23rd annual conference on Computer graphics and interactive techniques (1996), ACM Press, pp. 303--312. 5

Digital Library

[4]

{DMGL02} Davis J., Marschner S., Garr M., Levoy M.: Filling holes in complex surfaces using volumetric diffusion, 2002. 3, 6

[5]

{Ju04} Ju T.: Robust repair of polygonal models. ACM Trans. Graph. 23, 3 (2004), 888--895. 3

Digital Library

[6]

{KFR04} Kazhdan M., Funkhouser T., Rusinkiewicz S.: Symmetry descriptors and 3D shape matching. In Proc. Symposium on Geometry Processing (2004). 8

Digital Library

[7]

{Kol03} Kolluri R. K.: Spectral watertight surface reconstruction, 2003. 2

[8]

{KS96} Karger D. R., Stein C.: A new approach to the minimum cut problem. J. ACM 43, 4 (1996), 601--640. 3, 6

Digital Library

[9]

{KSE*03} Kwatra V., Schödl A., Essa I., Turk G., Bobick A.: Graphcut textures: Image and video synthesis using graph cuts. ACM Transactions on Graphics, SIGGRAPH 2003 22, 3 (July 2003), 277--286. 3

Digital Library

[10]

{Lie03} Liepa P.: Filling holes in meshes. In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing (2003), Eurographics Association, pp. 200--205. 2

Digital Library

[11]

{Mas04} Masuda T.: Filling the signed distance field by fitting local quadrics. In 3DPVT (2004), pp. 1003--1010. 3, 8

[12]

{MF97} Murali T. M., Funkhouser T. A.: Consistent solid and boundary representations from arbitrary polygonal data. In Proceedings of the 1997 symposium on Interactive 3D graphics (1997), ACM Press, pp. 155--ff. 3

Digital Library

[13]

{MV92} Mitchell S. A., Vavasis S. A.: Quality mesh generation in three dimensions. In Proceedings of the eighth annual symposium on Computational geometry (1992), ACM Press, pp. 212--221. 3, 5

Digital Library

[14]

{PSQ05} Paris S., Sillion F., Quan L.: A surface reconstruction method using global graph cut optimization. International Journal of Computer Vision (2005). to appear. 3

Digital Library

[15]

{SACO04} Sharf A., Alexa M., Cohen-Or D.: Context-based surface completion. ACM Trans. Graph. 23, 3 (2004), 878--887. 8

Digital Library

[16]

{She98} Shewchuk J. R.: Tetrahedral mesh generation by delaunay refinement. In Symposium on Computational Geometry (1998), pp. 86--95. 3

Digital Library

[17]

{SM00} Shi J., Malik J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8 (2000), 888--905. 3

Digital Library

[18]

{SRBP02} Savarese S., Rushmeier H. E., Bernardini F., Perona P.: Implementation of a shadow carving system for shape capture. In 3DPVT (2002), pp. 12--23. 6

Cited By

Diazzi LAttene M(2021)Convex polyhedral meshing for robust solid modelingACM Transactions on Graphics10.1145/3478513.348056440:6(1-16)Online publication date: 10-Dec-2021
https://dl.acm.org/doi/10.1145/3478513.3480564
Brunton ARmaileh L(2021)Displaced signed distance fields for additive manufacturingACM Transactions on Graphics10.1145/3450626.345982740:4(1-13)Online publication date: 19-Jul-2021
https://dl.acm.org/doi/10.1145/3450626.3459827
Setty SMudenagudi U(2018)Region of Interest-Based 3D Inpainting of Cultural Heritage ArtifactsJournal on Computing and Cultural Heritage 10.1145/313177811:2(1-21)Online publication date: 22-May-2018
https://dl.acm.org/doi/10.1145/3131778
Show More Cited By

Index Terms

Atomic volumes for mesh completion
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
  2. Computer graphics
    1. Image manipulation
    2. Shape modeling
      1. Parametric curve and surface models
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Index terms have been assigned to the content through auto-classification.

Recommendations

Semi-Regular Mesh Extraction from Volumes
Semi-Regular Mesh Extraction from Volumes
VISUALIZATION '00: Proceedings of the 11th IEEE Visualization 2000 Conference (VIS 2000)

We present a novel method to extract iso-surfaces from distancevolumes. It generates high quality semi-regular multiresolutionmeshes of arbitrary topology. Our technique proceeds in two stages.First, a very coarse mesh with guaranteed topology is ...
Quality delaunay meshing of polyhedral volumes and surfaces

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SGP '05: Proceedings of the third Eurographics symposium on Geometry processing

July 2005

236 pages

ISBN:390567324X

Conference Chairs:
Mathieu Desbrun
California Institute of Technology
,
Helmut Pottmann
Vienna University of Technology

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
EUROGRAPHICS: The European Association for Computer Graphics

Publisher

Eurographics Association

Goslar, Germany

Publication History

Published: 04 July 2005

Check for updates

Qualifiers

Article

Conference

SGP '05

Sponsor:

SIGGRAPH
EUROGRAPHICS

SGP '05: Geometry processing

July 4 - 6, 2005

Vienna, Austria

Acceptance Rates

SGP '05 Paper Acceptance Rate 22 of 87 submissions, 25%;

Overall Acceptance Rate 64 of 240 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Diazzi LAttene M(2021)Convex polyhedral meshing for robust solid modelingACM Transactions on Graphics10.1145/3478513.348056440:6(1-16)Online publication date: 10-Dec-2021
https://dl.acm.org/doi/10.1145/3478513.3480564
Brunton ARmaileh L(2021)Displaced signed distance fields for additive manufacturingACM Transactions on Graphics10.1145/3450626.345982740:4(1-13)Online publication date: 19-Jul-2021
https://dl.acm.org/doi/10.1145/3450626.3459827
Setty SMudenagudi U(2018)Region of Interest-Based 3D Inpainting of Cultural Heritage ArtifactsJournal on Computing and Cultural Heritage 10.1145/313177811:2(1-21)Online publication date: 22-May-2018
https://dl.acm.org/doi/10.1145/3131778
Setty SMudenagudi U(2018)Example-based 3D inpainting of point clouds using metric tensor and Christoffel symbolsMachine Vision and Applications10.1007/s00138-017-0886-729:2(329-343)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00138-017-0886-7
Chentanez NMüller MMacklin MKim T(2015)Fast grid-free surface trackingACM Transactions on Graphics10.1145/276699134:4(1-11)Online publication date: 27-Jul-2015
https://dl.acm.org/doi/10.1145/2766991
Centin MPezzotti NSignoroni A(2015)Poisson-driven seamless completion of triangular meshesComputer Aided Geometric Design10.1016/j.cagd.2015.03.00635:C(42-55)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.cagd.2015.03.006
Rojas MSukno FWaddington JWhelan PVandeborre JTabia H(2014)Quantitative comparison of hole filling methods for 3D object searchProceedings of the 7th Eurographics Workshop on 3D Object Retrieval10.5555/2854124.2854129(25-32)Online publication date: 6-Apr-2014
https://dl.acm.org/doi/10.5555/2854124.2854129
Attene M(2014)Direct repair of self-intersecting meshesGraphical Models10.1016/j.gmod.2014.09.00276:6(658-668)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.gmod.2014.09.002
Abbasinejad FJoshi PGrimm CAmenta NSimons LKara LGrimm C(2013)Surface patches for 3D sketchingProceedings of the International Symposium on Sketch-Based Interfaces and Modeling10.1145/2487381.2487387(53-60)Online publication date: 19-Jul-2013
https://dl.acm.org/doi/10.1145/2487381.2487387
Kazhdan MHoppe H(2013)Screened poisson surface reconstructionACM Transactions on Graphics10.1145/2487228.248723732:3(1-13)Online publication date: 4-Jul-2013
https://dl.acm.org/doi/10.1145/2487228.2487237
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten