Marco Attene
Marcel Campen
Skip Abstract Section
Abstract
Nowadays, digital 3D models are in widespread and ubiquitous use, and each specific application dealing with 3D geometry has its own quality requirements that restrict the class of acceptable and supported models. This article analyzes typical defects that make a 3D model unsuitable for key application contexts, and surveys existing algorithms that process, repair, and improve its structure, geometry, and topology to make it appropriate to case-by-case requirements.
The analysis is focused on polygon meshes, which constitute by far the most common 3D object representation. In particular, this article provides a structured overview of mesh repairing techniques from the point of view of the application context. Different types of mesh defects are classified according to the upstream application that produced the mesh, whereas mesh quality requirements are grouped by representative sets of downstream applications where the mesh is to be used. The numerous mesh repair methods that have been proposed during the last two decades are analyzed and classified in terms of their capabilities, properties, and guarantees. Based on these classifications, guidelines can be derived to support the identification of repairing algorithms best-suited to bridge the compatibility gap between the quality provided by the upstream process and the quality required by the downstream applications in a given geometry processing scenario.
- Allen, B., Curless, B., and popovic, Z. 2003. The space of human body shapes: Reconstruction and parameterization from range scans. ACM Trans. Graph. 22, 3, 587--594. Google Scholar
Digital Library
- Alliez, P., Ucelli, G., Gotsman, C., and Attene, M. 2008. Recent advances in remeshing of surfaces. In Shape Analysis and Structuring, L. De Floriani and M. Spagnuolo, Eds., Springer, 53--82.Google Scholar
- Andujar, C., Brunet, P., and Ayala, D. 2002. Topology-Reducing surface simplification using a discrete solid representation. ACM Trans. Graph. 21, 2, 88--105. Google ScholarDigital Library
- Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Rodgers, J., and Davis, J. 2005. Scape: Shape completion and animation of people. ACM Trans. Graph. 24, 3, 408--416. Google ScholarDigital Library
- Attene, M. 2010. A lightweight approach to repairing digitized polygon meshes. Vis. Comput. 26, 11, 1393--1406. Google ScholarDigital Library
- Attene, M. and Falcidieno, B. 2006. ReMESH: An interactive environment to edit and repair triangle meshes. In Proceedings of the International Conference on Shape Modeling and Applications. 271--276. Google ScholarDigital Library
- Attene, M., Falcidieno, B., Rossignac, J., and Spagnuolo, M. 2005. Sharpen and bend: Recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling. IEEE Trans. Visual Comput. Graph. 11, 2, 181--192. Google ScholarDigital Library
- Attene, M., Giorgi, D., Ferri, M., and Falcidieno, B. 2009. On converting sets of tetrahedra to combinatorial and pl manifolds. Comput. Aided Geom. Des. 26, 8, 850--864. Google ScholarDigital Library
- Bac, A., Tran, N.-V., and Daniel, M. 2008. A multistep approach to restoration of locally undersampled meshes. In Proceedings of the 5th International Conference on Advances in Geometric Modeling and Processing. 272--289. Google ScholarDigital Library
- Barequet, G., Duncan, C., and Kumar, S. 1998. RSVP: A geometric toolkit for controlled repair of solid models. IEEE Trans. Visual Comput. Graph. 4, 2, 162--177. Google ScholarDigital Library
- Barequet, G. and Kumar, S. 1997. Repairing cad models. In Proceedings of the 8th Conference on Visualization (VIS '97). IEEE Computer Society Press, 363--370. Google ScholarDigital Library
- Barequet, G. and Sharir, M. 1995. Filling gaps in the boundary of a polyhedron. Comput. Aided Geom. Des. 12, 2, 207--229. Google ScholarDigital Library
- Bendels, G. H., Schnabel, R., and Klein, R. 2005. Detail-Preserving surface inpainting. In Proceedings of the 6th International Symposium on Virtual Reality, Archaeology and Cultural Heritage (VAST). Eurographics Association, 41--48. Google ScholarDigital Library
- Bernardini, F. and Rushmeier, H. 2002. The 3D model acquisition pipeline. Comput. Graph. Forum 21, 2, 149--172.Google ScholarCross Ref
- Bernstein, G. and Fussell, D. 2009. Fast, exact, linear booleans. Comput. Graph. Forum 28, 5, 1269--1278. Google ScholarDigital Library
- Bischoff, S. and Kobbelt, L. 2005. Structure preserving cad model repair. Comput. Graph. Forum 24, 3, 527--536.Google ScholarCross Ref
- Bischoff, S., Pavic, D., and Kobbelt, L. 2005. Automatic restoration of polygon models. ACM Trans. Graph. 24, 4, 1332--1352. Google ScholarDigital Library
- Blanz, V., Mehl, A., Vetter, T., and Seidel, H.-P. 2004. A statistical method for robust 3D surface reconstruction from sparse data. In Proceedings of the 2nd International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT '04). 293--300. Google ScholarDigital Library
- Blanz, V. and Vetter, T. 1999. A morphable model for the synthesis of 3D faces. In Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques. ACM Press, New York, 187--194. Google ScholarDigital Library
- Bohn, J. H. and Wozny, M. J. 1992. 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. North-Holland Publishing Co., Amsterdam, The Netherlands, 297--319. Google ScholarDigital Library
- Borodin, P., Novotni, M., and Klein, R. 2002. Progressive gap closing for mesh repairing. In Advances in Modeling, Animation and Rendering. Springer, 201--213.Google Scholar
- Botsch, M. and Kobbelt, L. 2001. A robust procedure to eliminate degenerate faces from triangle meshes. In Proceedings of the Conference on Vision, Modeling and Visualization. 283--290. Google ScholarDigital Library
- Branch, J., Prieto, F., and Boulanger, P. 2006. Automatic hole-filling of triangular meshes using local radial basis function. In Proceedings of the 3rd International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06). IEEE Computer Society, 727--734. Google ScholarDigital Library
- Branch, J., Prieto, F., and Boulanger, P. 2006. Automatic hole-filling of triangular meshes using local radial basis function. In Proceedings of the 3rd International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06). IEEE Computer Society, 727--734. Google ScholarDigital Library
- Breckon, T. P. and Fisher, R. B. 2005. Non-Parametric 3D surface completion. In Proceedings of the 5th International Conference on 3-D Digital Imaging and Modeling. IEEE Computer Society, 573--580. Google ScholarDigital Library
- Brunton, A., Wuhrer, S., Shu, C., Bose, P., and Demaine, E. 2010. Filling holes in triangular meshes using digital images by curve unfolding. Int. J. Shape Model. 16, 1-2, 151--171.Google ScholarCross Ref
- Campen, M. and Kobbelt, L. 2010. Exact and robust (self-)intersections for polygonal meshes. Comput. Graph. Forum 29, 2, 397--406.Google ScholarCross Ref
- Chen, C.-Y. and Cheng, K.-Y. 2008. A sharpness dependent filter for recovering sharp features in repaired 3D mesh models. IEEE Trans. Visual Comp. Graph. 14, 1, 200--212. Google ScholarDigital Library
- Curless, B. and Levoy, M. 1996. A volumetric method for building complex models from range images. In Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '96). ACM Press, New York, 303--312. Google ScholarDigital Library
- Curless, B. and Seitz, S. 2000. 3D photography. In Course Notes for SIGGRAPH '00.Google Scholar
- Davis, J., Marschner, S. R., Garr, M., and Levoy, M. 2002. Filling holes in complex surfaces using volumetric diffusion. In Proceedings of the 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT '02). 428--438.Google Scholar
- De Floriani, L., Morando, F., and Puppo, E. 2003. Representation of non-manifold objects through decomposition into nearly manifold parts. In Proceedings of the 8th ACM Symposium on Solid Modeling and Applications. 304--309. Google ScholarDigital Library
- El-Sana, J. and Varshney, A. 1997. Controlled simplification of genus for polygonal models. In Proceedings of the IEEE Conference on Visualization. 403--410. Google ScholarDigital Library
- Fan, H., Yu, Y., and Peng, Q. 2010. Robust feature-preserving mesh denoising based on consistent subneighborhoods. IEEE Trans. Visual Comput. Graph. 16, 2, 312--324. Google ScholarDigital Library
- Farouki, R. 1999. Closing the gap between cad model and downstream application. SIAM News 32, 5, 303--319.Google Scholar
- Fischl, B., Liu, A., and Dale, A. M. 2001. Automated manifold surgery: Constructing geometrically accurate and topologically correct models of the human cerebral cortex. IEEE Trans. Med. Imag. 20, 1, 70--80.Google ScholarCross Ref
- Fleishman, S., Drori, I., and Cohen-or, D. 2003. Bilateral mesh denoising. ACM Trans. Graph. 22, 3, 950--953. Google ScholarDigital Library
- Furukawa, R., Itano, T., Morisaka, A., and Kawasaki, H. 2007. Improved space carving method for merging and interpolating multiple range images using information of light sources of active stereo. In Proceedings of the 8th Asian Conference on Computer Vision (ACCV'07). 206--216. Google ScholarDigital Library
- Granados, M., Hachenberger, P., Hert, S., Kettner, L., Mehlhorn, K., and Seel, M. 2003. Boolean operations on 3D selective nef complexes: Data structure, algorithms, and implementation. In Proceedings of the 11th European Symposium on Algorithms (ESA '03). 654--666.Google Scholar
- Gueziec, A., Taubin, G., Lazarus, F., and Horn, b. 2001. Cutting and stitching: Converting sets of polygons to manifold surfaces. IEEE Trans. Visual Comput. Graph. 7, 2, 136--151. Google ScholarDigital Library
- Guo, T.-Q., Li, J.-J., Weng, J.-G., and Zhuang, Y.-T. 2006. Filling holes in complex surfaces using oriented voxel diffusion. In Proceedings of the International Conference on Machine Learning and Cybernetics. 4370--4375.Google Scholar
- Guskov, I. and Wood, Z. 2001. Topological noise removal. In Proceedings of Graphics Interface. 19--26. Google ScholarDigital Library
- Han, X., Xu, C., Braga-Neto, U., and Prince, J. L. 2002. Topology correction in brain cortex segmentation using a multiscale, graph-based algorithm. IEEE Trans. Med. Imag. 21, 2, 109--121.Google ScholarCross Ref
- He, T., Hong, L., Varshney, A., and Wang, S. W. 1996. Controlled topology simplication. IEEE Trans. Visual. Comput. Graph. 2, 171--184. Google ScholarDigital Library
- Hetroy, F., Rey, S., Andujar, C., Brunet, P., and Vinacua, A. 2011. Mesh repair with user-friendly topology control. Comput. Aided Des. 43, 101--113. Google ScholarDigital Library
- Hildebrandt, K. and Polthier, K. 2004. Anisotropic filtering of non-linear surface features. Comput. Graph. Forum 23, 391--400.Google ScholarCross Ref
- Hornung, A. and Kobbelt, L. 2006. Robust reconstruction of watertight 3D models from nonuniformly sampled point clouds without normal information. In Proceedings of the Eurographics Symposium on Geometry Processing. 41--50. Google ScholarDigital Library
- Igarashi, T., Matsuoka, S., and Tanaka, H 1999. Teddy: a sketching interface for 3D freeform design. In Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques. ACM Press, New York. Google ScholarDigital Library
- Jia, J. and Tang, C. -K. 2004. Inference of segmented color and texture description by tensor voting. IEEE Trans. Pattern Anal. Mach. Intell. 26, 6, 771--786. Google ScholarDigital Library
- Jones, T. R., Durand, F., and Desbrun, M. 2003. Non-Iterative, feature-preserving mesh smoothing. ACM Trans. Graph. 22, 943--949. Google ScholarDigital Library
- Ju, T. 2004. Robust repair of polygonal models. ACM Trans. Graph. 23, 3, 888--895. Google ScholarDigital Library
- Ju, T. 2009. Fixing geometric errors on polygonal models: A survey. Comput. Sci. Technol. 24, 1, 19--29. Google ScholarDigital Library
- Ju, T., Zhou, Q.-Y., and Hu, S.-M. 2007. Editing the topology of 3D models by sketching. ACM Trans. Graph. 26, 3, 42-1-42-9. Google ScholarDigital Library
- Kahler, K., Haber, J., Yamauchi, H., and Seidel, H.-P. 2002. Head Shop: generating animated head models with anatomical structure. In Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA'02). 55--63. Google ScholarDigital Library
- Kobbelt, L. and Botsch, M. 2003. Feature sensitive mesh processing. In Proceedings of the 19th Spring Conference on Computer Graphics (SCCG'03). 17--22. Google ScholarDigital Library
- Kraevoy, V. and Sheffer, A. 2005. Template-based mesh completion. In Proceedings of the Eurographics Symposium on Geometry Processing. 13--22. Google ScholarDigital Library
- Kumar, A., Shih, A. M., Ito, Y., Ross, D. H., and Soni, B. K. 2007. A hole-filling algorithm using non-uniform rational b-splines. In Proceedings of the 16th International Meshing Roundtable. 169--182.Google Scholar
- Levy, B. 2003. Dual domain extrapolation. ACM Trans. Graph. 22, 3, 364--369. Google ScholarDigital Library
- LIEPA, P. 2003. Filling holes in meshes. In Proceedings of the Eurographics Symposium on Geometry Processing. 200--205. Google ScholarDigital Library
- Luebke, D. 2001. A developer's survey of polygonal simplification algorithms. Comput. Graph. Appl. 21, 3, 24--35. Google ScholarDigital Library
- Makela, I. and Dolenc, A. 1993. Some efficient procedures for correcting triangulated models. In Proceedings of the Symposium on Solid Freeform Fabrication. 126--134.Google Scholar
- Mantyla, M. 1988. Introduction to Solid Modeling. W.H. Freeman & Co. New York. Google ScholarDigital Library
- Masuda, T. 2004. Filling the signed distance field by fitting local quadrics. In Proceedings of the 2nd 3D Data Processing, Visualization, and Transmission International Symposium. IEEE Computer Society, 1003--1010. Google ScholarDigital Library
- Morvan, S. M. and Fadel, G. M. 1996. IVECS, interactively correcting STL files in a virtual environment. In Proceedings of the Symposium on Solid Freeform Fabrication. 491--498.Google Scholar
- Murali, T. and Funkhouser, T. 1997. Consistent solid and boundary representations from arbitrary polygonal data. In Proceedings of the Symposium on Interactive 3D Graphics. 155--162. Google ScholarDigital Library
- Nguyen, M. X., Yuan, X., and Chen, B. 2005. Geometry completion and detail generation by texture synthesis. Visual Comput. 21, 8--10, 669--678.Google ScholarCross Ref
- Nielson, G., Holliday, D., and Roxborough, T. 1999. Cracking the cracking problem with Coons patches. In Proceedings of the IEEE Visualization Conference. 285--290. Google ScholarDigital Library
- Nooruddin, F. and Turk, G. 2003. Simpli_cation and repair of polygonal models using volumetric techniques. ACM Trans. Vis. Comput. Graph. 9, 2, 191--205. Google ScholarDigital Library
- Oomes, S., Snoeren, P., and Dijkstra, T. 1997. 3D shape representation: Transforming polygons into voxels. In Proceedings of the 1st International Conference on Scale-Space Theory in Computer Vision. 349--352. Google ScholarDigital Library
- Park, S., Guo, X., Shin, H., and Qin, H. 2006. Surface completion for shape and appearance.Visual Comput. 22, 3, 168--180. Google ScholarDigital Library
- Patel, P. S., Marcum, D. L., and Remotigue, M. G. 2005. Stitching and filling: Creating conformal faceted geometry. In Procs of 14th International Meshing Roundtable. 239--256.Google Scholar
- Pauly, M., Mitra, N. J., Giesen, J., Gross, M., and Guibas, L. J. 2005. Example-Based 3D scan completion. In Proceedings of the Eurographics Symposium on Geometry Processing. 23--32. Google ScholarDigital Library
- Pernot, J. P., Moraru, G., and Veron, P. 2006. Filling holes in meshes using a mechanical model to simulate the curvature variation minimization. Comput. Graph. 30, 6, 892--902. Google ScholarDigital Library
- Pfeifle, R. and Seidel, H.-P. 1996. Triangular b-splines for blending and filling of polygonal holes. In Proceedings of the Conference on Graphics Interface (GI '96). Canadian Information Processing Society, 186--193. Google ScholarDigital Library
- Podolak, J. and Rusinkiewicz, S. 2005. Atomic volumes for mesh completion. In Eurographics Symposium on Geometry Processing. 33--42. Google ScholarDigital Library
- Rock, S. and Wozny, M. J. 1992. Generating topological information from a bucket of facets. In Proceedings of the Solid Freeform Fabrication Symposium. 251--259.Google Scholar
- Rossignac, J. and Cardoze, D. 1999. Matchmaker: Manifold breps for non-manifold r-sets. In Proceedings of the 5th ACM Symposium on Solid Modeling and Applications. 31--41. Google ScholarDigital Library
- Roth, G. and Wibowoo, E. 1997. An efficient volumetric method for building closed triangular meshes from 3-d image and point data. In Proceedings of the Conference on Graphics Interface. Canadian Information Processing Society, 173--180. Google ScholarDigital Library
- Sagawa, R. and Ikeuchi, K. 2003. Taking consensus of signed distance field for complementing unobservable surface. In Proceedings of the International Conference on 3D Digital Imaging and Modeling. 410--417.Google Scholar
- Sagawa, R. and Ikeuchi, K. 2008. Hole filling of a 3D model by flipping signs of a signed distance field in adaptive resolution. IEEE Trans. Pattern Anal. Mach. Intell. 30, 4, 686--699. Google ScholarDigital Library
- Savchenko, V. and Kojekine, N. 2002. An approach to blend surfaces. In Advances in Modeling, Animation and Rendering. 139--150.Google Scholar
- Seitz, S. M., Curless, B., Diebel, J., Scharstein, D., and Szeliski, R. 2006. A comparison and evaluation of multi-view stereo reconstruction algorithms. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 519--526. Google ScholarDigital Library
- Sharf, A., Alexa, M., and Cohen-Or, D. 2004. Context-based surface completion. ACM Trans. Graph. 23, 3, 878--887. Google ScholarDigital Library
- Sharf, A., Lewiner, T., Shklarski, G., Toledo, S., and Cohen-Or, D. 2007a. Interactive topology-aware surface reconstruction. ACM Trans. Graph. 26, 3, 43-1 43--9. Google ScholarDigital Library
- Sharf, A., Lewiner, T., Shklarski, G., Toledo, S., and Cohen-Or, D. 2007b. Interactive topology-aware surface reconstruction. ACM Trans. Graph. 26, 3. Google ScholarDigital Library
- Shattuck, D. W. and Lehay, R. M. 2001. Automated graph based analysis and correction of cortical volume topology. IEEE Trans. Med. Imag. 20, 11, 1167--1177.Google ScholarCross Ref
- Shen, C., O'Brien, J. F., and Shewchuk, J. R. 2004. Interpolating and approximating implicit surfaces from polygon soup. ACM Trans. Graph. 23, 3, 896--904. Google ScholarDigital Library
- Sheng, X. and Meier, I. R. 1995. Generating topological structures for surface modelsIEEE Comput. Graph. Appl. 15, 6, 35--41. Google ScholarDigital Library
- Shewchuk, J. R. 2002. Delaunay refinement algorithms for triangular mesh generation. Comput. Geom. Theory Appl. 22, 1-3, 21--74. Google ScholarDigital Library
- Spillmann, J., Wagner, M., and Teschner, M. 2006. Robust tetrahedral meshing of triangle soups. In Proceedings of the International Workshop on Vision, Modeling, and Visualization (VMV). 9--16.Google Scholar
- Sun, X., Rosin, P., Martin, R., and Langbein, F. 2007. Fast and effective feature-preserving mesh denoising. IEEE Trans. Vis. Comput. Graph. 13, 5, 925--938. Google ScholarDigital Library
- Szymczak, A. and Vanderhyde, J. 2003. Extraction of topologically simple isosurfaces from volume datasets. In Proceedings of the IEEE Visualization Conference. 67--74. Google ScholarDigital Library
- Taubin, G. 1995. A signal processing approach to fair surface design. In Proceedings of the SIGGRAPH 22nd Annual Conference on Computer Graphics and Interactive Techniques. ACM Press, New York, 351--358. Google ScholarDigital Library
- Tekumalla, L. S. and Cohen, E. 2004. A holefilling algorithm for triangular meshes. Tech. rep., School of Computing, University of Utah.Google Scholar
- Turk, G. and Levoy, M. 1994. Zippered polygon meshes from range images. In Proceedings of the SIGGRAPH 21st Annual Conference on Computer Graphics and Interactive Techniques. ACM Press, New York, 311--318. Google ScholarDigital Library
- Turk, G. and O'Brien, J. 2002. Modeling with implicit surfaces that interpolate. ACM Trans. Graph. 21, 4, 855--873. Google ScholarDigital Library
- Varnuska, M., Parus, J., and Kolingerova, I. 2005. Simple holes triangulation in surface reconstruction. In Proceedings of Algorithmy. 280--289.Google Scholar
- Verdera, J., Caselles, V., Bertalmio, M., and Sapiro, G. 2003. Inpainting surface holes. In Proceedings of the International Conference on Image Processing. 903--906.Google Scholar
- Vollmer, J., Mencl, R., and Mueller, H. 1999. Improved laplacian smoothing of noisy surface meshes. Comput. Graph. Forum 18, 3, 131--138.Google ScholarCross Ref
- Wagner, M., Labsik, U., and Greiner, G. 2003. Repairing non-manifold triangle meshes using simulated annealing. In Proceedings of the 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics. 88--93.Google Scholar
- Wang, C. 2006. Incremental reconstruction of sharp edges on mesh surfaces. Comput. Aided Des. 38, 6, 689--702. Google ScholarDigital Library
- Wang, J. and Oliveira, M. M. 2007. Filling holes on locally smooth surfaces reconstructed from point clouds. Image Visual Comput. 25, 1, 103--113.Google ScholarCross Ref
- Wei, M., Wu, J., and Pang, M. 2010. An integrated approach to filling holes in meshes. In Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence. IEEE Computer Society, 306--310. Google ScholarDigital Library
- Wood, Z., Hoppe, H., Desbrun, M., and Schroeder, P. 2004. Removing excess topology from isosurfaces. ACM Trans. Graph. 23, 2, 190--208. Google ScholarDigital Library
- Xiao, C., Zheng, W., Miao, Y., Zhao, Y., and Peng, Q. 2007. A uni_ed method for appearance and geometry completion of point set surfaces. Visual Comput. 23, 6, 433--443. Google ScholarDigital Library
- Xu, C., Pham, D., Rettmann, M., Yu, D., and Prince, J. 2002. Reconstruction of the human cerebral cortex from magnetic resonance images. IEEE Trans. Med. Imag. 18, 6, 467--480.Google ScholarCross Ref
- Xu, S., Georghiades, A., Rushmeier, H., Dorsey, J., and Mcmillan, L. 2006. Image guided geometry inference. In Proceedings of the 3rd International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT '06). IEEE Computer Society, 310--317. Google ScholarDigital Library
- Zhang, R., Tsai, P., Cryer, J., and Shah, M. 1999. Shape-From-Shading: A survey. IEEE Trans. Pattern Anal. Mach. Intell. 21, 8, 690--706. Google ScholarDigital Library
- Zhang, Y., Rohling, R., and Pai, D. 2002. Direct surface extraction from 3D freehand ultrasound images. IEEE Visualization 45--52. Google ScholarDigital Library
- Zhao, W., Gao, S., and Lin, H. 2007. A robust hole-filling algorithm for triangular mesh. Visual Comput. 23, 12, 897--997. Google ScholarDigital Library
- Zhou, Q., Ju, T., and Hu, S. 2007. Topology repair of solid models using skeletons. IEEE Trans. Visual. Comput. Graph. 13, 4, 675--685. Google ScholarDigital Library
Index Terms
- Polygon mesh repairing: An application perspective
Recommendations
Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral ...
Isotropic Surface Remeshing Using Constrained Centroidal Delaunay Mesh
We develop a novel isotropic remeshing method based on constrained centroidal Delaunay mesh (CCDM), a generalization of centroidal patch triangulation from 2D to mesh surface. Our method starts with resampling an input mesh with a vertex distribution ...
A hexahedral mesh connectivity compression with vertex degrees
This paper introduces a new algorithm for the compression of manifold hexahedral meshes topology, using vertex degree. The topology compression consists of two parts-the mesh's boundary consisting of quadrilaterals is compressed first, and then the ...
Comments