0
TECHNICAL PAPERS

Reconstruction of Virtual Parts from Unorganized Scanned Data for Automated Dimensional Inspection

[+] Author and Article Information
Chuan-Chu Kuo, Hong-Tzong Yau

Department of Mechanical Engineering, National Chung Cheng University, Cha-Yi, Taiwan, ROC

J. Comput. Inf. Sci. Eng 3(1), 76-86 (May 15, 2003) (11 pages) doi:10.1115/1.1565354 History: Received October 01, 2002; Revised February 01, 2003; Online May 15, 2003
Copyright © 2003 by ASME
Your Session has timed out. Please sign back in to continue.

References

Yau, H. T., and Kuo, C. C., 2002, “Virtual CMM and Virtual Part for Intelligent Dimensional Inspection,” 2002 Japan-USA Symposium on Flexible Automation, pp. 1289–1296.
Hoppe, H., DeRose, T., Duchamp, McDonald, T., J., and Stuetzle, W., 1992, “Surface Reconstruction from Unorganized Points,” Proc. SIGGRAPH ’92, pp. 71–78.
Amenta, N., Bern, M., and Kamvysselis, M., 1998, “A New Voronoi-based Surface Reconstruction Algorithm,” Proc. SIGGRAPH ’98, pp. 415–421.
Amenta,  N., and Bern,  M., 1999, “Surface Reconstruction by Voronoi Filtering,” Discrete Comput. Geom., 22, pp. 481–504.
Amenta, N., Choi, S., and Kolluri, R. V., 2001, “The Power Crust,” Proc. 6th ACM Sympos. on Solid modeling and applications, pp. 249–266.
Amenta,  N., Choi,  S., and Kolluri,  R. K., 2001, “The Power Crust, Unions of Balls, and the Medial Axis Transform,” Computational Geometry: Theory and Applications, 19 (2–3), pp. 127–153.
Dey,  T. K., Giesen,  J., Leekha,  N., and Wenger,  R., 2001, “Detecting Boundaries for Surface Reconstruction Using Co-cones,” Intl. J. Comput. Graphics & CAD/CAM, 16 , pp. 141–159.
Dey, T. K., and Giesen, J., 2001, “Detecting Undersampling in Surface Reconstruction,” Proc. 17th ACM Sympos. on Comput. Geom, pp. 257–63.
Dey, T. K., Giesen, J., Goswami, S., Hudson, J., Wenger, R., and Zhao, W., 2001, “Undersampling and Oversampling in Sample Based Shape Modeling,” Proc. IEEE Visualization 2001, pp. 83–90.
Boissonnat,  J. D., 1984, “Geometric Structures for Three-dimensional Shape Representation,” ACM Trans. Graph., 3(4), pp. 266–286.
Edelsbrunner,  H., Kirkpatrick,  D. G., and Seidel,  R., 1983, “On the Shape of a Set of Points in the Plane,” IEEE Trans. Inf. Theory, IT-29, pp. 551–559.
Edelsbrunner, H., 1992, “Weighted Alpha Shapes,” Technical Report UIUCDCS-R-92-1760, Department of Computer Science, University of Illinois, Urbana-Champagne, IL.
Edelsbrunner,  H., and Mucke,  E. P., 1994, “Three-dimensional Alpha Shapes,” ACM Trans. Graphics, 13(1), pp. 43–72.
Bernardini,  F., Mittleman,  J., Rushmeier,  H., Silva,  C., and Taubin,  G., 1999, “The Ball-Pivoting Algorithm for Surface Reconstruction,” IEEE Trans. Vis. Comput. Graph., 5(4), pp. 349–359.
Petitjean,  S., and Boyer,  E., 2001, “Regular and Non-regular Point Sets: Properties and Reconstruction,” Comput. Geom. Theory Appl., 19 , pp. 101–126.
Huang,  J., and Menq,  C. H., 2002, “Combinatorial Manifold Mesh Reconstruction and Optimization from Unorganized Points with Arbitrary Topology,” Comput.-Aided Des., 34(2), pp. 149–165.
Bajaj, C., Bernardini, F., and Xu, G., 1995, “Automatic Reconstruction of Surfaces and Scalar Fields from 3D Scans,” Proc. SIGGRAPH ’95, pp. 109–118.
Bajaj, C., Bernardini, F., Chen, J., and Schikore, D., 1997, “Triangulation-based 3D Reconstruction Methods,” Proc. 13th ACM Sympos. on Comput. Geom., pp. 484–484.
Bajaj,  C., Bernardini,  F., and Xu,  G., 1997, “Reconstruction of Surfaces and Surfaces-on-Surfaces from Unorganized Three-Dimensional Data,” Algorithmica, 19, pp. 243–261.
Bernardini,  F., Bajaj,  C., Chen,  J., and Schikore,  D., 1999, “Automatic Reconstruction of 3D CAD Models from Digital Scans,” Int. J. on Comp. Geom. and Appl., 9 (4–5), pp. 327–370.
Curless, B., and Levoy, M., 1996, “A Volumetric Method for Building Complex Models from Range Images,” Proc. SIGGRAPH ’96, pp. 303–312.
Boissonnat, J-D., and Cazals, F., 2000, “Smooth Surface Reconstruction via Natural Neighbor Interpolation of Distance Functions,” Proc. 16th. ACM Sympos. on Comput. Geom, pp. 223–232.
Bentley,  L., 1975, “Multidimensional Binary Search Trees Used for Associative Searching,” Commun. ACM, 18(9), pp. 509–517.
Edelsbrunner,  H., and Guoy,  D., 2002, “Sink-insertion for Mesh Improvement,” Int. J. Found. Comput. Sci., 13 , pp. 223–242.
Yau,  H. T., Kuo,  C. C., and Yeh,  C. H., 2002, “Extension of Surface Reconstruction Algorithm to the Global Stitching and Repairing of STL Models,” Comput.-Aided Des., 35(5), pp. 477–486.
Jun,  C. S., Kim,  D. S., and Park,  S., 2002, “A New Curve-based Approach to Polyhedral Machining,” Comput.-Aided Des., 34(5), pp. 379–389.
Aurenhammer,  F., 1991, “Voronoi Diagrams—A Survey of a Fundamental Geometric Data Structure,” ACM Comput. Surv., 23(3), pp. 345–405.
http://www.cgal.org/
Boissonnat, J. D., Devillers, O., Teillaud, M., and Yvinec, M., 2000, “Triangulations in CGAL,” Proc. 14th ACM Sympos. On Comput. Geom., pp. 11–18.
Brönnimann, H., Burnikel, C., and Pion S., 1998, “Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry,” Proc. 14th. ACM Sympos. on Comput. Geom., pp. 165–174.
Devillers, O., 1998, “Improved Incremental Randomized Delaunay Triangulation,” Proc. 14th ACM Sympos. Comput. on Geom., pp. 106–115.
http://www.cs.utexas.edu/users/amenta/powercrust/welcome.html
http://www.cis.ohio-state.edu/∼tamaldey/cocone.html

Figures

Grahic Jump Location
The illustration of the sculpting idea in 3D space.
Grahic Jump Location
The illustration of the sculpting idea in 2D plane.
Grahic Jump Location
The internal and external medial axis and the medial circles of a closed curve in two dimensions.
Grahic Jump Location
(a) The distribution of all the polar circles (black circles) centered at the poles (red points shown in (b)) in 2D plane. (b) The illustration of a pair of polar circles and its pair of corresponding inscribed squares.
Grahic Jump Location
The detailed pseudo-code for the pole-separation procedure.
Grahic Jump Location
An example of a two-dimensional closed curve reconstruction.
Grahic Jump Location
An example of a three-dimensional closed surface reconstruction (a torso model).
Grahic Jump Location
An example of the effect of all the concave poles on the creation of the boundary (a foot).
Grahic Jump Location
An example of a three-dimensional bordered surface reconstruction (a hyper sheet).
Grahic Jump Location
The reconstruction from the sample points with uneven distribution. (a rocker arm).
Grahic Jump Location
An example of the effect of poles on the reconstruction of the geometric sharp features (a shoe model).
Grahic Jump Location
Several examples of closed surface reconstruction. (a) A three-hole model. (b) An oil pump model. (c) A hand model. (d) A baby dragon model.
Grahic Jump Location
Several examples of bordered surfaces reconstruction. (a) A hand model. (b) A shampoo bottle model. (c) A monkey bar. (d) A golf club model. (e) An automobile exterior surface.
Grahic Jump Location
The comparison of our proposed algorithm with the power crust algorithm. (a) The reconstruction from the proposed algorithm. The number of output points is 1748. (b) The reconstruction from the power crust without a decimated post process. The number of output points is 14927.
Grahic Jump Location
Top row is a knot and bottom row is a femur. (a) The reconstruction from the proposed algorithm. (b) The reconstruction from the modified co-cone. (c) The reconstruction from the tight co-cone.

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In