{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:22:42Z","timestamp":1768735362920,"version":"3.49.0"},"reference-count":34,"publisher":"ASME International","issue":"2","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,1]]},"abstract":"<jats:p>We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours by a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded. Therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated B-rep of given solids, the memory cost our approach is low\u2014only the binary image and the finest contours on one particular slicing plane need to be stored in-core. Our method is general and can be applied to any implicit representations of solids.<\/jats:p>","DOI":"10.1115\/1.4024067","type":"journal-article","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T14:02:04Z","timestamp":1367330524000},"update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":39,"title":["Intersection-Free and Topologically Faithful Slicing of Implicit Solid"],"prefix":"10.1115","volume":"13","author":[{"given":"Pu","family":"Huang","sequence":"first","affiliation":[{"name":"Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Hong Kong, PRC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charlie C. L.","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Hong Kong, PRC; Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089 e-mail:"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Chen","sequence":"additional","affiliation":[{"name":"Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2013,4,26]]},"reference":[{"key":"2019100600540049900_B1","unstructured":"Ju, T., and Udeshi, T., 2006, \u201cIntersection-Free Contouring on an Octree Grid,\u201d Proceedings of the 14th Pacific Conference on Computer Graphics and Applications."},{"key":"2019100600540049900_B2","unstructured":"Varadhan, R., Krishnan, S., Zhang, L., and Manocha, D., 2006, \u201cReliable Implicit Surface Polygonization Using Visibility Mapping,\u201d Proceedings of the Symposium on Geometry Processing."},{"key":"2019100600540049900_B3","doi-asserted-by":"crossref","unstructured":"Chen, Y., and Wang, C. C. L., 2008, \u201cLayered Depth-Normal Images for Complex Geometries\u2014Part One: Accurate Sampling and Adaptive Modeling,\u201d Proceedings of the ASME IDETC\/CIE Conference, 28th Computers and Information in Engineering Conference, New York, Paper No. DETC2008-49432.","DOI":"10.1115\/DETC2008-49432"},{"key":"2019100600540049900_B4","doi-asserted-by":"crossref","unstructured":"Wang, C. C. L., and Chen, Y., 2008, \u201cLayered Depth-Normal Images for Complex Geometries C Part Two: Manifold-Preserved Adaptive Contouring,\u201d Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences, New York, Aug. 3\u20136, Paper No. DETC2008-49576.","DOI":"10.1115\/DETC2008-49576"},{"issue":"3","key":"2019100600540049900_B5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/566654.566586","article-title":"Dual Contouring of Hermite Data","volume":"21","year":"2002","journal-title":"ACM Trans. Graphics"},{"key":"2019100600540049900_B6","volume-title":"Rapid Prototyping: Principles and Applications","year":"2003"},{"key":"2019100600540049900_B7","doi-asserted-by":"crossref","unstructured":"Fuchs, H., Kedem, Z. M., and Nalor, B. F., 1980, \u201cOn Visible Surface Generation by a Priori Tree Structures,\u201d Proceedings of the ACM SIGGRAPH 1980, pp. 124\u2013133.","DOI":"10.1145\/965105.807481"},{"key":"2019100600540049900_B8","doi-asserted-by":"crossref","unstructured":"Ohtake, Y., Belyaev, A., and Seidel, H. P., 2004, \u201c3D Scattered Data Approximation With Adaptive Compactly Supported Radial Basis Functions,\u201d Proceedings of the Shape Modeling International 2004, pp. 31\u201339.","DOI":"10.1109\/SMI.2004.1314491"},{"key":"2019100600540049900_B9","doi-asserted-by":"crossref","unstructured":"Luo, R. C., and Ma, Y., 1995, \u201cA Slicing Algorithm for Rapid Prototyping and Manufacturing,\u201d Proceedings of the IEEE International Conference on Robotics and Automation, 1995, pp. 2841\u20132846.","DOI":"10.1109\/ROBOT.1995.525686"},{"key":"2019100600540049900_B10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0734-189X(86)90115-5","article-title":"The Characterization of Parametric Surface Sections","volume":"33","year":"1986","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"8","key":"2019100600540049900_B11","first-page":"112","article-title":"Intersection of Parametric Surfaces and a Plane","volume":"4","year":"1981","journal-title":"IEEE Comput. Graph. Appl."},{"key":"2019100600540049900_B12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0167-8396(90)90035-P","article-title":"A Marching Method for Parametric Surface\/Surface Intersection","volume":"7","year":"1990","journal-title":"Comput. Aided Geom. Des."},{"key":"2019100600540049900_B13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-8396(87)90020-3","article-title":"Surface\/Surface Intersection","volume":"4","year":"1987","journal-title":"Comput. Aided Geom. Des."},{"issue":"3","key":"2019100600540049900_B14","doi-asserted-by":"crossref","first-page":"031003","DOI":"10.1115\/1.2955481","article-title":"Adaptive Slicing of Moving Least Squares Surfaces: Toward Direct Manufacturing of Point Set Surfaces","volume":"8","year":"2008","journal-title":"ASME J. Comput. Inf. Sci. Eng."},{"key":"2019100600540049900_B15","article-title":"Direct Slicing of Cloud Data With Guaranteed Topology for Rapid Prototyping","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"2019100600540049900_B16","doi-asserted-by":"crossref","first-page":"031002","DOI":"10.1115\/1.4006463","article-title":"Direct Numerical Control (NC) Path Generation: From Discrete Points to Continuous Spline Paths","volume":"12","year":"2012","journal-title":"ASME J. Comput. Inf. Sci. Eng."},{"issue":"4","key":"2019100600540049900_B17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/37402.37422","article-title":"Marching Cubes: A High Resolution 3D Surface Construction Algorithm","volume":"21","year":"1987","journal-title":"Comput. Graph."},{"key":"2019100600540049900_B18","doi-asserted-by":"crossref","unstructured":"Kobbelt, L. P., Botsch, M., Schwanecke, U., and Seidel, H., 2001, \u201cFeature Sensitive Surface Extraction From Volume Data,\u201d Proceedings of the ACM SIGGRAPH 2001, pp. 57\u201366.","DOI":"10.1145\/383259.383265"},{"issue":"1","key":"2019100600540049900_B19","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1111\/j.1467-8659.2007.01039.x","article-title":"Pressing: Smooth Isosurfaces With Flats From Binary Grids","volume":"27","year":"2008","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"2019100600540049900_B20","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/TPAMI.2007.250604","article-title":"Topological Equivalence Between a 3D Object and the Reconstruction of Its Digital Image","volume":"29","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2019100600540049900_B21","doi-asserted-by":"crossref","unstructured":"Hoppe, H., 1996, \u201cProgressive Meshes,\u201d Proceedings of the ACM SIGGRAPH 1996, pp. 99\u2013108.","DOI":"10.1145\/237170.237216"},{"key":"2019100600540049900_B22","doi-asserted-by":"crossref","unstructured":"Klein, R., Liebich, G., and Strasser, W., 1996, \u201cMesh Reduction With Error Control,\u201d Proceedings of the IEEE Visualization, pp. 311\u2013318.","DOI":"10.1109\/VISUAL.1996.568124"},{"key":"2019100600540049900_B23","doi-asserted-by":"crossref","unstructured":"Garland, M., and Heckbert, P. S., 1998, \u201cSimplifying Surfaces With Color and Texture Using Quadric Error Metrics,\u201d Proceedings of the IEEE Visualization, pp. 263\u2013269.","DOI":"10.1109\/VISUAL.1998.745312"},{"key":"2019100600540049900_B24","doi-asserted-by":"crossref","unstructured":"Lindstrom, P., and Turk, G., 1998, \u201cFast and Memory Efficient Polygonal Simplification,\u201d Proceedings of the IEEE Visualization, pp. 279\u2013286.","DOI":"10.1109\/VISUAL.1998.745314"},{"key":"2019100600540049900_B25","doi-asserted-by":"crossref","unstructured":"Maillot, J., Yahia, H., and Verroust, A., 1993, \u201cInteractive Texture Mapping,\u201d Proceedings of the ACM SIGGRAPH 1993, pp. 27\u201334.","DOI":"10.1145\/166117.166120"},{"issue":"3","key":"2019100600540049900_B26","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/38.491187","article-title":"Superfaces: Polygonal Mesh Simplification With Bounded Error","volume":"16","year":"1996","journal-title":"IEEE Comput. Graph. Appl."},{"key":"2019100600540049900_B27","unstructured":"Inoue, K., Itoh, T., Yamada, A., Furuhata, T., and Shimada, K., 1999, \u201cClustering a Large Number of Faces for 2-Dimensional Mesh Generation,\u201d Proceedings of the Eighth International Meshing Roundtable, pp. 281\u2013292."},{"key":"2019100600540049900_B28","first-page":"925","article-title":"Model Simplification for Meshing Using Face Clustering","volume":"33","year":"2000","journal-title":"Comput.-Aided Des."},{"key":"2019100600540049900_B29","doi-asserted-by":"crossref","unstructured":"Sander, P., Snyder, J., Gortler, S., and Hoppe, H., 2001, \u201cTexture Mapping Progressive Meshes,\u201d Proceedings of the ACM SIGGRAPH 2001, pp. 409\u2013416.","DOI":"10.1145\/383259.383307"},{"key":"2019100600540049900_B30","doi-asserted-by":"crossref","unstructured":"Garland, M., Willmott, A., and Heckbert, P. S., 2001, \u201cHierarchical Face Clustering on Polygonal Surfaces,\u201d Proceedings of the 2001 Symposium on Interactive 3D Graphics.","DOI":"10.1145\/364338.364345"},{"key":"2019100600540049900_B31","doi-asserted-by":"crossref","unstructured":"Grinspun, E., and Schr\u00f6der, P., 2001, \u201cNormal Bounds for Subdivision-Surface Interference Detection,\u201d Proceedings of the IEEE Scientific Visualization, pp. 333\u2013340.","DOI":"10.1109\/VISUAL.2001.964529"},{"key":"2019100600540049900_B32","doi-asserted-by":"crossref","unstructured":"L\u00e9vy, B., Petitjean, S., Ray, N., and Maillot, J., 2002, \u201cLeast Squares Conformal Maps for Automatic Texture Atlas Generation,\u201d Proceedings of the ACM SIGGRAPH 2002, pp. 362\u2013371.","DOI":"10.1145\/566570.566590"},{"key":"2019100600540049900_B33","doi-asserted-by":"crossref","unstructured":"Cohen-Steiner, D., Alliez, P., and Desbrun, M., 2004, \u201cVariational Shape Approximation,\u201d Proceedings of the ACM SIGGRAPH 2004, pp. 905\u2013914.","DOI":"10.1145\/1186562.1015817"},{"issue":"2","key":"2019100600540049900_B34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least Square. Quantization in PCM","volume":"28","year":"1982","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4024067\/6099966\/jcis_13_2_021009.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4024067\/6099966\/jcis_13_2_021009.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:01:12Z","timestamp":1745996472000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/doi\/10.1115\/1.4024067\/371419\/IntersectionFree-and-Topologically-Faithful"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,26]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4024067","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"value":"1530-9827","type":"print"},{"value":"1944-7078","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,26]]},"article-number":"021009"}}