Ju, T., and Udeshi, T., 2006, “Intersection-Free Contouring on an Octree Grid,” Proceedings of the 14th Pacific Conference on Computer Graphics and Applications.

Varadhan, R., Krishnan, S., Zhang, L., and Manocha, D., 2006, “Reliable Implicit Surface Polygonization Using Visibility Mapping,” Proceedings of the Symposium on Geometry Processing.

Chen, Y., and Wang, C. C. L., 2008, “Layered Depth-Normal Images for Complex Geometries—Part One: Accurate Sampling and Adaptive Modeling,” Proceedings of the ASME IDETC/CIE Conference, 28th Computers and Information in Engineering Conference, New York, Paper No. DETC2008-49432.

Wang, C. C. L., and Chen, Y., 2008, “Layered Depth-Normal Images for Complex Geometries C Part Two: Manifold-Preserved Adaptive Contouring,” Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences, New York, Aug. 3–6, Paper No. DETC2008-49576.

Ju, T., Losasso, F., Schaefer, S., and Warren, J., 2002, “Dual Contouring of Hermite Data,” ACM Trans. Graphics, 21(3), pp. 339–346.

[CrossRef]Chua, C. K., Leong, K. F., and Lim, C. S., 2003, *Rapid Prototyping: Principles and Applications*, World Scientific, Singapore.

Fuchs, H., Kedem, Z. M., and Nalor, B. F., 1980, “On Visible Surface Generation by a Priori Tree Structures,” Proceedings of the ACM SIGGRAPH 1980, pp. 124–133.

Ohtake, Y., Belyaev, A., and Seidel, H. P., 2004, “3D Scattered Data Approximation With Adaptive Compactly Supported Radial Basis Functions,” Proceedings of the Shape Modeling International 2004, pp. 31–39.

Luo, R. C., and Ma, Y., 1995, “A Slicing Algorithm for Rapid Prototyping and Manufacturing,” Proceedings of the IEEE International Conference on Robotics and Automation, 1995, pp. 2841–2846.

Farouki, R. T., 1986, “The Characterization of Parametric Surface Sections,” Comput. Vis. Graph. Image Process., 33, pp. 209–236.

[CrossRef]Lee, R. B., and Fredericks, D. A., 1981, “Intersection of Parametric Surfaces and a Plane,” IEEE Comput. Graph. Appl., 4(8), pp. 112–117.

Barnhill, R. E., and Kersey, S. N., 1990, “A Marching Method for Parametric Surface/Surface Intersection,” Comput. Aided Geom. Des., 7, pp. 257–280.

[CrossRef]Barnhill, R. E., Farin, G. E., Jordan, M., and Piper, B. R., 1987, “Surface/Surface Intersection,” Comput. Aided Geom. Des., 4, pp. 3–16.

[CrossRef]Yang, P., and Qian, X., 2008, “Adaptive Slicing of Moving Least Squares Surfaces: Toward Direct Manufacturing of Point Set Surfaces,” ASME J. Comput. Inf. Sci. Eng., 8(3), p. 031003.

[CrossRef]Qiu, Y., Zhou, X., and Qian, X., 2010, “Direct Slicing of Cloud Data With Guaranteed Topology for Rapid Prototyping,” Int. J. Adv. Manuf. Technol., (accepted).

Liu, Y., Xia, S., and Qian, X., 2012, “Direct Numerical Control (NC) Path Generation: From Discrete Points to Continuous Spline Paths,” ASME J. Comput. Inf. Sci. Eng., 12(3), p. 031002.

[CrossRef]Lorensen, W. E., and Cline, H. E., 1987, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Comput. Graph., 21(4), pp. 163–169.

[CrossRef]Kobbelt, L. P., Botsch, M., Schwanecke, U., and Seidel, H., 2001, “Feature Sensitive Surface Extraction From Volume Data,” Proceedings of the ACM SIGGRAPH 2001, pp. 57–66.

Chica, A., Willliams, J., Andujar, C., Brunet, P., Navazo, I., Rossignac, J., and Vinacua, A., 2008, “Pressing: Smooth Isosurfaces With Flats From Binary Grids,” Comput. Graph. Forum, 27(1), pp. 36–46.

[CrossRef]Stelldinger, P., LateckiL. J., and Siqueira, M., 2007, “Topological Equivalence Between a 3D Object and the Reconstruction of Its Digital Image,” IEEE Trans. Pattern Anal. Mach. Intell., 29(1), pp. 126–140.

[CrossRef] [PubMed]Hoppe, H., 1996, “Progressive Meshes,” Proceedings of the ACM SIGGRAPH 1996, pp. 99–108.

Klein, R., Liebich, G., and Strasser, W., 1996, “Mesh Reduction With Error Control,” Proceedings of the IEEE Visualization, pp. 311–318.

Garland, M., and Heckbert, P. S., 1998, “Simplifying Surfaces With Color and Texture Using Quadric Error Metrics,” Proceedings of the IEEE Visualization, pp. 263–269.

Lindstrom, P., and Turk, G., 1998, “Fast and Memory Efficient Polygonal Simplification,” Proceedings of the IEEE Visualization, pp. 279–286.

Maillot, J., Yahia, H., and Verroust, A., 1993, “Interactive Texture Mapping,” Proceedings of the ACM SIGGRAPH 1993, pp. 27–34.

Kalvin, A. D., and Taylor, R. H., 1996, “Superfaces: Polygonal Mesh Simplification With Bounded Error,” IEEE Comput. Graph. Appl., 16(3), pp. 64–77.

[CrossRef]Inoue, K., Itoh, T., Yamada, A., Furuhata, T., and Shimada, K., 1999, “Clustering a Large Number of Faces for 2-Dimensional Mesh Generation,” Proceedings of the Eighth International Meshing Roundtable, pp. 281–292.

Sheffer, A., 2000, “Model Simplification for Meshing Using Face Clustering,” Comput.-Aided Des., 33, pp. 925–934.

[CrossRef]Sander, P., Snyder, J., Gortler, S., and Hoppe, H., 2001, “Texture Mapping Progressive Meshes,” Proceedings of the ACM SIGGRAPH 2001, pp. 409–416.

Garland, M., Willmott, A., and Heckbert, P. S., 2001, “Hierarchical Face Clustering on Polygonal Surfaces,” Proceedings of the 2001 Symposium on Interactive 3D Graphics.

Grinspun, E., and Schröder, P., 2001, “Normal Bounds for Subdivision-Surface Interference Detection,” Proceedings of the IEEE Scientific Visualization, pp. 333–340.

Lévy, B., Petitjean, S., Ray, N., and Maillot, J., 2002, “Least Squares Conformal Maps for Automatic Texture Atlas Generation,” Proceedings of the ACM SIGGRAPH 2002, pp. 362–371.

Cohen-Steiner, D., Alliez, P., and Desbrun, M., 2004, “Variational Shape Approximation,” Proceedings of the ACM SIGGRAPH 2004, pp. 905–914.

Lloyd, A. P., 1982, “Least Square. Quantization in PCM,” IEEE Trans. Inf. Theory, 28(2), pp. 129–137.

[CrossRef]