{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T06:32:34Z","timestamp":1791268354010,"version":"4.1.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2005,10]]},"abstract":"<jats:p>\n            We present a fully automatic technique which converts an inconsistent input mesh into an output mesh that is guaranteed to be a clean and consistent mesh representing the closed manifold surface of a solid object. The algorithm removes all typical mesh artifacts such as degenerate triangles, incompatible face orientation, non-manifold vertices and edges, overlapping and penetrating polygons, internal redundant geometry, as well as gaps and holes up to a user-defined maximum size \u03c1. Moreover, the output mesh always stays within a prescribed tolerance \u03b5 to the input mesh. Due to the effective use of a hierarchical octree data structure, the algorithm achieves high voxel resolution (up to 4096\n            <jats:sup>3<\/jats:sup>\n            on a 2GB PC) and processing times of just a few minutes for moderately complex objects. We demonstrate our technique on various architectural CAD models to show its robustness and reliability.\n          <\/jats:p>","DOI":"10.1145\/1095878.1095883","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"1332-1352","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":106,"title":["Automatic restoration of polygon models"],"prefix":"10.1145","volume":"24","author":[{"given":"Stephan","family":"Bischoff","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darko","family":"Pavic","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leif","family":"Kobbelt","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/508357.508359"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.694983"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the IEEE Visualization. 363--370","author":"Barequet G.","unstructured":"Barequet , G. and Kumar , S . 1997. Repairing cad models . In Proceedings of the IEEE Visualization. 363--370 . Barequet, G. and Kumar, S. 1997. Repairing cad models. In Proceedings of the IEEE Visualization. 363--370."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8396(94)00011-G"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the Pacific Graphics. 246--255","author":"Bischoff S.","unstructured":"Bischoff , S. and Kobbelt , L . 2002. Isosurface reconstruction with topology control . In Proceedings of the Pacific Graphics. 246--255 . Bischoff, S. and Kobbelt, L. 2002. Isosurface reconstruction with topology control. In Proceedings of the Pacific Graphics. 246--255."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the Symposium on Solid Freeform Fabrication. 86--94","author":"Wozny M","unstructured":"B&oslace;hn, J. and Wozny , M . 1992. Automatic cad-model repair: Shell-closure . In Proceedings of the Symposium on Solid Freeform Fabrication. 86--94 . B&oslace;hn, J. and Wozny, M. 1992. Automatic cad-model repair: Shell-closure. In Proceedings of the Symposium on Solid Freeform Fabrication. 86--94."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Borodin P. Novotni M. and Klein R. 2002. Progressive gap closing for mesh repairing. In Advances in Modelling Animation and Rendering J. Vince and R. Earnshaw Eds. Springer Verlag 201--213.  Borodin P. Novotni M. and Klein R. 2002. Progressive gap closing for mesh repairing. In Advances in Modelling Animation and Rendering J. Vince and R. Earnshaw Eds. Springer Verlag 201--213.","DOI":"10.1007\/978-1-4471-0103-1_13"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/78956.78959"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the International Symposium on 3D Data Processing, Visualization, Transmission. 428--438","author":"Davis J.","unstructured":"Davis , J. , Marschner , S. , Garr , M. , and Levoy , M . 2002. Filling holes in complex surfaces using volumetric diffusion . In Proceedings of the International Symposium on 3D Data Processing, Visualization, Transmission. 428--438 . Davis, J., Marschner, S., Garr, M., and Levoy, M. 2002. Filling holes in complex surfaces using volumetric diffusion. In Proceedings of the International Symposium on 3D Data Processing, Visualization, Transmission. 428--438."},{"key":"e_1_2_1_10_1","unstructured":"Dolenc A. and M\u00e4kel\u00e4 I. 1991. Optimized triangulation of parametric surfaces. Techn. rep. TKO-B74 Helsinki University of Technology.  Dolenc A. and M\u00e4kel\u00e4 I. 1991. Optimized triangulation of parametric surfaces. Techn. rep. TKO-B74 Helsinki University of Technology."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of SIGGRAPH. 249--254","author":"Frisken S. F.","unstructured":"Frisken , S. F. , Perry , R. N. , Rockwood , A. P. , and Jones , T. R . 2000. Adaptively sampled distance fields: a general representation of shape for computer graphics . In Proceedings of SIGGRAPH. 249--254 . 10.1145\/344779.344899 Frisken, S. F., Perry, R. N., Rockwood, A. P., and Jones, T. R. 2000. Adaptively sampled distance fields: a general representation of shape for computer graphics. In Proceedings of SIGGRAPH. 249--254. 10.1145\/344779.344899"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of SIGGRAPH. 209--216","author":"Garland M.","unstructured":"Garland , M. and Heckbert , P. S . 1997. Surface simplification using quadric error metrics . In Proceedings of SIGGRAPH. 209--216 . 10.1145\/258734.258849 Garland, M. and Heckbert, P. S. 1997. Surface simplification using quadric error metrics. In Proceedings of SIGGRAPH. 209--216. 10.1145\/258734.258849"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of IEEE Symposium on","volume":"30","author":"Gibson S. F. F.","year":"1998","unstructured":"Gibson , S. F. F. 1998 . Using distance maps for accurate surface representation in sampled volumes . In Proceedings of IEEE Symposium on Volume Visualization. 23-- 30 . 10.1145\/288126.288142 Gibson, S. F. F. 1998. Using distance maps for accurate surface representation in sampled volumes. In Proceedings of IEEE Symposium on Volume Visualization. 23--30. 10.1145\/288126.288142"},{"key":"e_1_2_1_14_1","unstructured":"Gonzalez R. and Woods R. 1992. Digital Image Processing. Addison-Wesley.   Gonzalez R. and Woods R. 1992. Digital Image Processing. Addison-Wesley."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of SIGGRAPH. 171--180","author":"Gottschalk S.","unstructured":"Gottschalk , S. , Lin , M. C. , and Manocha , D . 1996. Obbtree: A hierarchical structure for rapid interference detection . In Proceedings of SIGGRAPH. 171--180 . 10.1145\/237170.237244 Gottschalk, S., Lin, M. C., and Manocha, D. 1996. Obbtree: A hierarchical structure for rapid interference detection. In Proceedings of SIGGRAPH. 171--180. 10.1145\/237170.237244"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 11th Pacific Conference on Computer Graphics and Applications (PG'03)","author":"Gre\u00df A.","unstructured":"Gre\u00df , A. and Klein , R . 2003. Efficient representation and extraction of 2-manifold isosurfaces using kd-trees . In Proceedings of the 11th Pacific Conference on Computer Graphics and Applications (PG'03) . 364--376. Gre\u00df, A. and Klein, R. 2003. Efficient representation and extraction of 2-manifold isosurfaces using kd-trees. In Proceedings of the 11th Pacific Conference on Computer Graphics and Applications (PG'03). 364--376."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.928166"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of Graphics Interface. 19--26","author":"Guskov I.","unstructured":"Guskov , I. and Wood , Z. J . 2001. Topological noise removal . In Proceedings of Graphics Interface. 19--26 . Guskov, I. and Wood, Z. J. 2001. Topological noise removal. In Proceedings of Graphics Interface. 19--26."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015815"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the SIGGRAPH. 339--346","author":"Ju T.","unstructured":"Ju , T. , Losasso , F. , Schaefer , S. , and Warren , J . 2002. Dual contouring of hermite data . In Proceedings of the SIGGRAPH. 339--346 . 10.1145\/566570.566586 Ju, T., Losasso, F., Schaefer, S., and Warren, J. 2002. Dual contouring of hermite data. In Proceedings of the SIGGRAPH. 339--346. 10.1145\/566570.566586"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/280814.280831"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383265"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(89)90147-3"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the Symposium on Geometry Processing 03","author":"Liepa P.","year":"2003","unstructured":"Liepa , P. 2003 . Filling holes in meshes . In Proceedings of the Symposium on Geometry Processing 03 . 200--205. Liepa, P. 2003. Filling holes in meshes. In Proceedings of the Symposium on Geometry Processing 03. 200--205."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of SIGGRAPH. 163--169","author":"Lorensen W. E.","unstructured":"Lorensen , W. E. and Cline , H. E . 1987. Marching cubes: A high resolution 3d surface construction algorithm . In Proceedings of SIGGRAPH. 163--169 . 10.1145\/37401.37422 Lorensen, W. E. and Cline, H. E. 1987. Marching cubes: A high resolution 3d surface construction algorithm. In Proceedings of SIGGRAPH. 163--169. 10.1145\/37401.37422"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2003.1196006"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.513"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of SIGGRAPH. 351--358","author":"Taubin G.","year":"1995","unstructured":"Taubin , G. 1995 . A signal processing approach to fair surface design . In Proceedings of SIGGRAPH. 351--358 . 10.1145\/218380.218473 Taubin, G. 1995. A signal processing approach to fair surface design. In Proceedings of SIGGRAPH. 351--358. 10.1145\/218380.218473"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of SIGGRAPH 94","author":"Turk G.","year":"1921","unstructured":"Turk , G. and Levoy , M . 1994. Zippered polygon meshes from range images . In Proceedings of SIGGRAPH 94 . 311--318. 10.1145\/ 1921 61.192241 Turk, G. and Levoy, M. 1994. Zippered polygon meshes from range images. In Proceedings of SIGGRAPH 94. 311--318. 10.1145\/192161.192241"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the Symposium on Geometry Processing. 116--126","author":"Varadhan G.","unstructured":"Varadhan , G. , Krishnan , S. , Kim , Y. , Diggavi , S. , and Manocha , D . 2003. Efficient max-norm distance computation and reliable voxelization . In Proceedings of the Symposium on Geometry Processing. 116--126 . Varadhan, G., Krishnan, S., Kim, Y., Diggavi, S., and Manocha, D. 2003. Efficient max-norm distance computation and reliable voxelization. In Proceedings of the Symposium on Geometry Processing. 116--126."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 2nd Workshop on Algorithm Engineering. 1--12","author":"Weihe K.","unstructured":"Weihe , K. and Willhalm , T . 1998. Why cad data repair requires discrete algorithmic techniques . In Proceedings of the 2nd Workshop on Algorithm Engineering. 1--12 . Weihe, K. and Willhalm, T. 1998. Why cad data repair requires discrete algorithmic techniques. In Proceedings of the 2nd Workshop on Algorithm Engineering. 1--12."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of Graphics Interface. 185--192","author":"Wu J.","unstructured":"Wu , J. and Kobbelt , L . 2003. A stream algorithm for the decimation of massive meshes . In Proceedings of Graphics Interface. 185--192 . Wu, J. and Kobbelt, L. 2003. A stream algorithm for the decimation of massive meshes. In Proceedings of Graphics Interface. 185--192."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095878.1095883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095878.1095883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:28Z","timestamp":1750262908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095878.1095883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["10.1145\/1095878.1095883"],"URL":"https:\/\/doi.org\/10.1145\/1095878.1095883","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]},"assertion":[{"value":"2005-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}