Skip to main content
Log in

Fixing Geometric Errors on Polygonal Models: A Survey

  • Survey
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Polygonal models are popular representations of 3D objects. The use of polygonal models in computational applications often requires a model to properly bound a 3D solid. That is, the polygonal model needs to be closed, manifold, and free of self-intersections. This paper surveys a sizeable literature for repairing models that do not satisfy this criteria, focusing on categorizing them by their methodology and capability. We hope to offer pointers to further readings for researchers and practitioners, and suggestions of promising directions for future research endeavors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aktouf Z, Bertrand G, Perroton L. A three-dimensional holes closing algorithm. Pattern Recogn. Lett., 2002, 23(5): 523–531.

    Article  MATH  Google Scholar 

  2. Veleba D, Felkel P. Detection and correction of errors in surface representation. In Proc. the 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, Plzen-Bory, Czech Republic, 2007, pp.65–72.

  3. Breckon T P, Fisher R B. Amodal volume completion: 3D visual completion. Comput. Vis. Image Underst., 2005, 99(3): 499–526.

    Article  Google Scholar 

  4. Mencl R, Muller H. Interpolation and approximation of surfaces from three-dimensional scattered data points. In Proc. Scientific Visualization (Dagstuhl’97), IEEE Computer Society, Washington DC, USA, 1999, pp.223–232.

  5. Bohn J H, Wozny M J. A topology-based approach for shell-closure. In Selected and Expanded Papers from the IFIP TC5/WG5.2 Working Conference on Geometric Modeling for Product Realization, Amsterdam, The Netherlands, North-Holland Publishing Co., 1992, pp.297–319.

    Google Scholar 

  6. Makela I, Dolenc A. Some efficient procedures for correcting triangulated models. In Proc. Solid Free Form Fabrication Symposium, Austin, Texas, USA, August 9–11, 1993, pp.126–134.

  7. Pernot J P, Moraru G, Veron P. Filling holes in meshes using a mechanical model to simulate the curvature variation minimization. Comput. Graph., 2006, 30(6): 892–902.

    Article  Google Scholar 

  8. Patel P S, Marcum D L, Remotigue M G. Stitching and filling: Creating conformal faceted geometry. In Proc. the 14th International Meshing Roundtable, San Diego, USA, Sept. 2005, pp.239–256.

  9. Levy B. Dual domain extrapolation. ACM Trans. Graph., 2003, 22(3): 364–369.

    Article  Google Scholar 

  10. Nguyen M X, Yuan X, Chen B. Geometry completion and detail generation by texture synthesis. The Visual Computer, 2005, 21(8–10): 669–678.

    Article  Google Scholar 

  11. Sharf A, Alexa M, Cohen-Or D. Context-based surface completion. In ACM SIGGRAPH 2004 Papers (SIGGRAPH’04), Los Angeles, California, USA, August 8–12, 2004, pp.878–887.

  12. Barequet G, Sharir M. Filling gaps in the boundary of a polyhedron. Comput. Aided Geom. Des., 1995, 12(2): 207–229.

    Article  MATH  MathSciNet  Google Scholar 

  13. Rock S J, Wozny M J. Generating topological information from a “bucket of facets”. In Proc. Solid Freeform Fabrication Symposium, Austin, USA, August 3–5, 1992, pp.251–259.

  14. Sheng X, Meier I R. Generating topological structures for surface models. IEEE Comput. Graph. Appl., 1995, 15(6): 35–41.

    Article  Google Scholar 

  15. Barequet G, Kumar S. Repairing CAD models. In Proc. the 8th Conference on Visualization (VIS’97), Los Alamitos: IEEE Computer Society Press, CA, USA, 1997, pp.363–ff.

  16. Borodin P, Novotni M, Klein R. Progressive gap closing for mesh repairing. In Proc. CGI’02, Bradford, UK, 2002, pp.201–213.

  17. Hoppe H. Progressive meshes. In Proc. the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’96), New Orleans, USA, August 1996, pp.99–108.

  18. Garland M, Heckbert P S. Surface simplification using quadric error metrics. In Proc. the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’97), Los Angeles, USA, August 3–8, 1997, pp.209–216.

  19. Barequet G, Dickerson M, Eppstein D. On triangulating three-dimensional polygons. In Proc. the Twelfth Annual Symposium on Computational Geometry (SCG’96), Philadelphia, USA, August 1996, pp.38–47.

  20. Wagner M, Labsik U, Greiner G. Repairing non-manifold triangle meshes using simulated annealing. International Journal of Shape Modeling, 2003, 9(2): 137–153.

    Article  MATH  Google Scholar 

  21. Varnuska M, Parus J, Kolingerova I. Simple holes triangulation in surface reconstruction. In Proc. Algoritmy, Vysoke Tatry, Podbanske, March 2005, pp.280–289.

  22. Liepa P. Filling holes in meshes. In Proc. the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing (SGP’03), Aachen, Germany, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland, 2003, pp.200–205.

  23. Attene M, Falcidieno B. ReMESH: An interactive environment to edit and repair triangle meshes. In Proc. the IEEE International Conference on Shape Modeling and Applications 2006 (SMI’06), Matsushima, Japan, March 2006, p.41.

  24. Roth G, Wibowoo E. An efficient volumetric method for building closed triangular meshes from 3-D image and point data. In Proc. the Conference on Graphics Interface’97, Kelowna, Canada, June 23–27, 1997, pp.173–180.

  25. Zhao W, Gao S, Lin H. A robust hole-filling algorithm for triangular mesh. Vis. Comput., 2007, 23(12): pp.987–997.

    Article  Google Scholar 

  26. Bac A, Tran N V, Daniel M. A multistep approach to restoration of locally undersampled meshes. In Proc. GMP, Hangzhou, China, April 23–25, 2008, pp.272–289.

  27. Clarenz U, Diewald U, Dziuk G, Rumpf M, Rusu R. A finite element method for surface restoration with smooth boundary conditions. Comput. Aided Geom. Des., 2004, 21(5): 427–445.

    MATH  MathSciNet  Google Scholar 

  28. Pfeifle R, Seidel H P. Triangular B-splines for blending and filling of polygonal holes. In Proc. the Conference on Graphics Interface (GI’96), Toronto, Ont., Canada, Canadian Information Processing Society, 1996, pp.186–193.

  29. Wang J, Oliveira M M. Filling holes on locally smooth surfaces reconstructed from point clouds. Image Vision Comput., 2007, 25(1): 103–113.

    Article  Google Scholar 

  30. Tekumalla L S, Cohen E. A hole-filling algorithm for triangular meshes. Technical Report UUCS-04-019, University of Utah, 2004.

  31. Branch J, Prieto F, Boulanger P. Automatic hole-filling of triangular meshes using local radial basis function. In Proc. the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT’06), Chapel Hill, USA, June 14–16, 2006, pp.727–734.

  32. Chen C Y, Cheng K Y. A sharpness-dependent filter for recovering sharp features in repaired 3D mesh models. IEEE Transactions on Visualization and Computer Graphics, 2008, 14(1): 200–212.

    Article  Google Scholar 

  33. Kumar A, Shih A M, Ito Y, Ross D H, Soni B K. A hole-filling algorithm using non-uniform rational B-splines. In Proc. the 16th International Meshing Roundtable, Seattle, USA, Oct. 14–17, 2007, pp.169–182.

  34. Jia J, Tang C K. Inference of segmented color and texture description by tensor voting. IEEE Trans. Pattern Anal. Mach. Intell., 2004, 26(6): 771–786.

    Article  Google Scholar 

  35. Kraevoy V, Sheffer A. Template-based mesh completion. In Proc. the Third Eurographics Symposium on Geometry Processing (SGP’05), Vienna, Austria, Eurographics Association, Aire-la-Ville, Switzerland, 2005, p.13.

  36. Bendels G H, Schnabel R, Klein R. Detail-preserving surface inpainting. In Proc. the 6th International Symposium on Virtual Reality, Archaeology and Cultural Heritage, Pisa, Italy, June 2005, pp.41–48.

  37. Breckon T P, Fisher R B. Non-Parametric 3D surface completion. In Proc. the Fifth International Conference on 3-D Digital Imaging and Modeling (3DIM ‘05), Ottawa, Canada, June 13–16, 2005, pp.573–580.

  38. Park S, Guo X, Shin H, Qin H. Surface completion for shape and appearance. Vis. Comput., 2006, 22(3): 168–180.

    Article  Google Scholar 

  39. Xiao C, Zheng W, Miao Y, Zhao Y, Peng Q. A unified method for appearance and geometry completion of point set surfaces. Vis. Comput., 2007, 23(6): 433–443.

    Article  Google Scholar 

  40. Xu S, Georghiades A, Rushmeier H, Dorsey J, McMillan L. Image guided geometry inference. In Proc. the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT’06), Chapel Hill, USA, June 14–16, 2006, pp.310–317.

  41. Pauly M, Mitra N J, Wallner J, Pottmann H, Guibas L. Discovering structural regularity in 3D geometry. ACM Transactions on Graphics, 2008, 27(3): 1–11.

    Article  Google Scholar 

  42. Blanz V, Vetter T. A morphable model for the synthesis of 3D faces. In Proc. the 26th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’99), Los Angeles, August 8–13, 1999, pp.187–194.

  43. Kahler K, Haber J, Yamauchi H, Seidel H P. Head shop: Generating animated head models with anatomical structure. In Proc. the 2002 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA’02), San Antonio, Texas, USA, July 21–26, 2002, pp.55–63.

  44. Allen B, Curless B, Popoviæ Z. The space of human body shapes: Reconstruction and parameterization from range scans. In ACM SIGGRAPH 2003 Papers (SIGGRAPH’03), San Diego, California, USA, July 27–31, 2003, pp.587–594.

  45. Blanz V, Mehl A, Vetter T, Seidel H P. A statistical method for robust 3D surface reconstruction from sparse data. In Proc. 2nd International Symp. 3D Data Processing, Visualization, and Transmission, (3DPVT’04), Thessaloniki, Greece, Sept. 6–9, 2004, pp.293–300.

  46. Anguelov D, Srinivasan P, Koller D, Thrun S, Rodgers J, Davis J. SCAPE: Shape completion and animation of people. ACM Trans. Graph., 2005, 24(3): pp.408–416.

    Article  Google Scholar 

  47. Savchenko V, Kojekine N. An approach to blend surfaces. In Proc. CGI’02, Bradford, UK, July 1–5, 2002, pp.139–150.

  48. Huang Y, Wang Q, Huang Z, Wu J. Repairing incomplete measured data with a deformable model under constraints of feature shapes. The International Journal of Advanced Manufacturing, 2006, 28(1/2): 92–100.

    Google Scholar 

  49. Pauly M, Mitra N J, Giesen J, Gross M, Guibas L J. Example-based 3D scan completion. In Proc. the Third Eurographics Symposium on Geometry Processing (SGP’05), Vienna, Austria, July 4–6, 2005, p.23.

  50. Barequet G, Duncan C A, Kumar S. RSVP: A geometric toolkit for controlled repair of solid models. IEEE Transactions on Visualization and Computer Graphics, 1998, 4(2): 162–177.

    Article  Google Scholar 

  51. Gueziec A, Taubin G, Lazarus F, Horn B. Cutting and stitching: Converting sets of polygons to manifold surfaces. IEEE Transactions on Visualization and Computer Graphics, 2001, 7(2): 136–151.

    Article  Google Scholar 

  52. Baum D R, Mann S, Smith K P, Winget J M. Making radiosity usable: Automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions. SIGGRAPH Comput. Graph., 1991, 25(4): 51–60.

    Article  Google Scholar 

  53. Jan Helge Bohn. Removing zero-volume parts from CAD models for layered manufacturing. IEEE Comput. Graph. Appl., 1995, 15(6): 27–34.

    Article  Google Scholar 

  54. Rocchini C, Cignoni P, Ganovelli F, Montani C, Pingi P, Scopigno R. The marching intersections algorithm for merging range images. Vis. Comput., 2004, 20(2): 149–164.

    Article  Google Scholar 

  55. Turk G, Levoy M. Zippered polygon meshes from range images. In Proc. the 21st Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’94), New York, NY, USA, ACM, 1994, pp.311–318.

  56. Lorensen W E, Cline H E. Marching cubes: A high resolution 3D surface construction algorithm. SIGGRAPH Comput. Graph., 1987, 21(4): 163–169.

    Article  Google Scholar 

  57. Nielson G M, Hamann B. The asymptotic decider: Resolving the ambiguity in marching cubes. In Proc. the 2nd Conference on Visualization (VIS’91), Los Alamitos, CA, USA, IEEE Computer Society Press, 1991, pp.83–91.

    Google Scholar 

  58. Montani C, Scateni R, Scopigno R. A modified look-up table for implicit disambiguation of marching cubes. The Visual Computer, 1994, 10(6): 353–355.

    Article  Google Scholar 

  59. Allen van Gelder, Jane Wilhelms. Topological considerations in isosurface generation. ACM Trans. Graph., 1994, 13(4): 337–375.

    Article  Google Scholar 

  60. Gibson S F F. Using distance maps for accurate surface representation in sampled volumes. In Proc. the 1998 IEEE Symposium on Volume Visualization (VVS’98), New York, USA, ACM, 1998, pp.23–30.

    Chapter  Google Scholar 

  61. Ju T, Losasso F, Schaefer S, Warren J. Dual contouring of hermite data. In Proc. the 29th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’02), San Antonio, Texas, USA, July 21–26, 2002, pp.339–346.

  62. Ashida K, Badler N I. Feature preserving manifold mesh from an octree. In Proc. Symposium on Solid Modeling and Applications, Seattle, USA, June 16–20, 2003, pp.292–297.

  63. Zhang N, Hong W, Kaufman A E. Dual contouring with topology-preserving simplification using enhanced cell representation. In Proc. IEEE Visualization, Austin, USA, Oct. 10–15, 2004, pp.505–512.

  64. Schaefer S, Ju T, Warren J. Manifold dual contouring. IEEE Transactions on Visualization and Computer Graphics, 2007, 13(3): 610–619.

    Article  Google Scholar 

  65. Ju T, Udeshi T. Intersection-free contouring on an octree grid. In Proc. Pacific Graphics’06, Oct. 11–13, 2006, Taipei, Taiwan, China.

  66. Gress A, Klein R. Efficient representation and extraction of 2-manifold isosurfaces using kd-trees. Graph. Models, 2004, 66(6): 370–397.

    Article  Google Scholar 

  67. Jones M W, Baerentzen J A, Sramek M. 3D distance fields: A survey of techniques and applications. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(4): 581–599.

    Article  Google Scholar 

  68. Ju T. Robust repair of polygonal models. ACM Trans. Graph., 2004, 23(3): 888–895.

    Article  Google Scholar 

  69. Davis J, Marschner S R, Garr M, Levoy M. Filling holes in complex surfaces using volumetric diffusion. In Proc. 3DPVT, Padova, Italy, June 19–21, 2002, pp.428–438.

  70. Masuda T. Filling the signed distance field by fitting local quadrics. In Proc. 2nd International Symp. the 3D Data Processing, Visualization, and Transmission (3DPVT’04), Thessaloniki, Greece, June 19–21, 2004, pp.1003–1010.

  71. Oomes S, Snoeren P, Dijkstra T. 3D shape representation: Transforming polygons into voxels. In Proc. the First International Conference on Scale-Space Theory in Computer Vision (SCALE-SPACE’97), London, UK, Springer-Verlag, July 1997, pp.349–352.

    Google Scholar 

  72. Andujar C, Brunet P, Ayala D. Topology-reducing surface simplification using a discrete solid representation. ACM Trans. Graph., 2002, 21(2): 88–105.

    Article  Google Scholar 

  73. Fakir S Nooruddin, Greg Turk. Simplification and repair of polygonal models using volumetric techniques. IEEE Trans. Vis. Comput. Graph., 2003, 9(2): 191–205.

    Article  Google Scholar 

  74. Spillmann J, Wagner M, Teschner M. Robust tetrahedral meshing of triangle soups. In Proc. Vision, Modeling, Visualization (VMV’06), Aachen, Germany, Nov. 22–24, 2006, pp.9–15.

  75. Hornung A, Kobbelt L. Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information. In Proc. the Fourth Eurographics Symposium on Geometry Processing (SGP’06), Sardinia, Italy, June 2006, pp.41–50.

  76. Bischoff S, Pavic D, Kobbelt L. Automatic restoration of polygon models. ACM Trans. Graph., 2005, 24(4): 1332–1352.

    Article  Google Scholar 

  77. Curless B, Levoy M. A volumetric method for building complex models from range images. In Proc. the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’96), New Orleans, USA, August 4–9, 1996, pp.303–312.

  78. Furukawa R, Itano T, Morisaka A, Kawasaki H. Improved space carving method for merging and interpolating multiple range images using information of light sources of active stereo. In Proc. ACCV (2), Tokyo, Japan, Nov. 2007, pp.206–216.

  79. Sagawa R, Ikeuchi K. Taking consensus of signed distance field for complementing unobservable surface. In Proc. 3DIM, Banff, Canada, Oct. 2003, pp.410–417.

  80. Sagawa M R, Ikeuchi F K. Hole filling of a 3D model by flipping signs of a signed distance field in adaptive resolution. IEEE Trans. Pattern Anal. Mach. Intell., 2008, 30(4): 686–699.

    Article  Google Scholar 

  81. Guo T Q, Li J J, Weng J G, Zhuang Y T. Filling holes in complex surfaces using oriented voxel diffusion. In Proc. 2006 International Conference on Machine Learning and Cybernetics, Dalian, China, August 2006, pp.4370–4375.

  82. Verdera J, Caselles V, Bertalmio M, Sapiro G. Inpainting surface holes. In Proc. Int. Conference on Image Processing, Barcelona, Spain, Sept. 2003, pp.903–906.

  83. Shen C, O’Brien J F, Shewchuk J R. Interpolating and approximating implicit surfaces from polygon soup. In ACM SIGGRAPH 2004 Papers (SIGGRAPH’04), Los Angeles, California, USA, August 8–12, 2004, pp.896–904.

  84. Carr J C, Beatson R K, Cherrie J B, Mitchell T J, Fright W R, McCallum B C, Evans T R. Reconstruction and representation of 3D objects with radial basis functions. In Proc. the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’01), Los Angeles, USA, August 12–17, 2001, pp.67–76.

  85. Kazhdan M, Bolitho M, Hoppe H. Poisson surface reconstruction. In Proc. the Fourth Eurographics Symposium on Geometry Processing (SGP’06), Sardinia, Italy, June 26–28, 2006, pp.61–70.

  86. Kobbelt L P, Botsch M, Schwanecke U, Seidel H P. Feature sensitive surface extraction from volume data. In Proc. the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’01), Los Angeles, USA, August 12–17, 2001, pp.57–66.

  87. Brunet P, Navazo I. Solid representation and operation using extended octrees. ACM Trans. Graph., 1990, 9(2): 170–197.

    Article  MATH  Google Scholar 

  88. Bischoff S, Kobbelt L. Structure preserving CAD model repair. Comput. Graph. Forum, 2005, 24(3): 527–536.

    Article  Google Scholar 

  89. Podolak J, Rusinkiewicz S. Atomic volumes for mesh completion. In Proc. the third Eurographics Symposium on Geometry Processing (SGP’05), Vienna, Austria, July 4–6, 2005, p.33.

  90. Murali T M, Funkhouser T A. Consistent solid and boundary representations from arbitrary polygonal data. In Proc. the 1997 Symposium on Interactive 3D Graphics (SI3D’97), New York, NY, USA, April 27–30, 1997, pp.155–ff.

  91. Sharf A, Lewiner T, Shklarski G, Toledo S, Cohen-Or D. Interactive topology-aware surface reconstruction. ACM Trans. Graph., 2007, 26(3): 43.

    Article  Google Scholar 

  92. Wood Z J, Hoppe H, Desbrun M, Schroder P. Removing excess topology from isosurfaces. ACM Trans. Graph., 2004, 23(2): 190–208.

    Article  Google Scholar 

  93. Ju T, Zhou Q Y, Hu S M. Editing the topology of 3D models by sketching. ACM Trans. Graph., 2007, 26(3): 42.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tao Ju.

Additional information

This work is supported in part by NSF of USA under Grant Nos. CCF-0702662 and DBI-0743691.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 81.1 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ju, T. Fixing Geometric Errors on Polygonal Models: A Survey. J. Comput. Sci. Technol. 24, 19–29 (2009). https://doi.org/10.1007/s11390-009-9206-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9206-7

Keywords

Navigation