0
RESEARCH PAPERS

Efficient Computation of A Simplified Medial Axis

[+] Author and Article Information
Mark Foskey

Department of Radiology, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-7515e-mail: foskey@cs.unc.edu

Ming C. Lin, Dinesh Manocha

Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-7515e-mail: dm@cs.unc.edu

J. Comput. Inf. Sci. Eng 3(4), 274-284 (Dec 24, 2003) (11 pages) doi:10.1115/1.1631582 History: Received July 01, 2003; Revised October 01, 2003; Online December 24, 2003
Copyright © 2003 by ASME
Your Session has timed out. Please sign back in to continue.

References

Blum, H., 1967, “A Transformation for Extracting New Descriptors of Shape,” Models for the Perception of Speech and Visual Form, W. Wathen-Dunn, Ed. MIT Press, pp. 362–380.
Amenta, N., Choi, S., and Kolluri, R., 2001, “The Power Crust,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 249–260.
Dey, T. K., and Zhao, W., 2002, “Approximate Medial Axis as a Voronoi Subcomplex,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 356–366.
Storti, D. W., Turkiyyah, G. M., Ganter, M. A., Lim, C. T., and Stal, D. M., 1997, “Skeleton-Based Modeling Operations on Solids,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 141–154.
Lam,  L., Lee,  S.-W., and Chen,  C. Y., 1992, “Thinning Methodologies—A Comprehensive Survey,” IEEE Trans. Pattern Anal. Mach. Intell., 14(9), pp. 869–885.
Zhang,  Y. Y., and Wang,  P. S. P., 1993, “Analytical Comparison of Thinning Algorithms,” Int. J. Pattern Recognit. Artif. Intell., 7, pp. 1227–1246.
Danielsson,  P. E., 1980, “Euclidean Distance Mapping,” Computer Graphics and Image Processing, 14, pp. 227–248.
Ragnemalm,  I., 1993, “The Euclidean Distance Transformation in Arbitrary Dimensions,” Pattern Recogn. Lett., 14, pp. 883–888.
Vleugels, J., and Overmars, M., 1995, Approximating generalized Voronoi diagrams in any dimension, Tech. Rep. UU-CS-1995-14, Department of Computer Science, Utrecht University.
Hoff, K., Culver, T., Keyser, J., Lin, M., and Manocha, D., 1999, “Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware,” Proc. ACM SIGGRAPH, pp. 277–286.
Siddiqi, K., Bouix, S., Tannenbaum, A., and Zucker, S. W., 1999, “The Hamilton-Jacobi Skeleton,” International Conference on Computer Vision, pp. 828–834.
Etzion, M., and Rappoport, A., 1999, “Computing the Voronoi Diagram of a 3-D Polyhedron by Separate Computation of its Symbolic and Geometric Parts,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 167–178.
Milenkovic, V., 1993, “Robust Construction of the Voronoi Diagram of a Polyhedron,” Proc. 5th Canad. Conf. Comput. Geom., pp. 473–478.
Reddy,  J., and Turkiyyah,  G., 1995, “Computation of 3D Skeletons Using a Generalized Delaunay Triangulation Technique,” Comput.-Aided Des., 27, pp. 677–694.
Chiang, C.-S., 1992, “The Euclidean distance transform,” Ph.D. Thesis, Dept. Comput. Sci., Purdue Univ., West Lafayette, IN, Aug, Report CSD-TR 92-050.
Sherbrooke, E. C., Patrikalakis, N. M., and Brisson, E., 1995, “Computation of the Medial Axis Transform of 3-D Polyhedra,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 187–199.
Culver, T. Keyser, J., and Manocha, D., 1999, “Accurate Computation of the Medial Axis of a Polyhedron,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 179–190.
Dutta, D., and Hoffmann, C. M., 1990, “A Geometric Investigation of the Skeleton of CSG Objects,” Proc. ASME Conf. Design Automation.
Hoffmann, C. M., 1990, “How to Construct the Skeleton of CSG Objects,” Proc. 4th IMA Conf. on the Mathematics of Surfaces, Oxford University Press.
Boissonnat,  J.-D., 1984, “Geometric Structures for Three-Dimensional Shape Representation,” ACM Trans. Graphics, 3(4), pp. 266–286.
Dey, T. K., and Zhao, W., 2002, “Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee,” European Symposium on Algorithms, pp. 387–398.
Turkiyyah,  G. M., Storti,  D. W., Ganter,  M., Chen,  H., and Vimawala,  M., 1997, “An Accelerated Triangulation Method for Computing the Skeletons of Free-Form Solid Models,” Comput.-Aided Des., 29(1), pp. 5–19.
Attali, D., and Boissonnat, J., 2002, “A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 139–146.
August, J., Tannenbaum, A., and Zucker, S., 1999, “On the Evolution of the Skeleton,” Proc. of Int. Conf. on Computer Vision.
Attali,  D., and Montanvert,  A., 1997, “Computing and Simplifying 2D and 3D Continuous Skeletons,” Comput. Vis. Image Underst., 67(3), pp. 261–273.
Boissonnat, J.-D., and Cazals, F., 2000, “Smooth Surface Reconstruction Via Natural Neighbor Interpolation of Distance Functions,” Proc. ACM Symposium on Computational Geometry, pp. 223–232.
Styner,  M., Gerig,  G., Joshi,  S., and Pizer,  S., 2003, “Automatic and Robust Computation of 3D Medial Models Incorporating Object Variability,” Int. J. Comput. Vis. 55, pp. 107–122.
Choi, S. W., and Seidel, H.-P., 2002, “Linear Onesided Stability of MAT for Weakly Injective 3D Domain,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 344–355.
Larsen, E., Gottschalk, S., Lin, M., and Manocha, D., 1999, “Fast Proximity Queries with Swept Sphere Volumes,” Tech. Rep. TR99-018, Department of Computer Science, University of North Carolina. 32 pages.
Taubin, G., 1995, “A Signal Processing Approach to Fair Surface Design,” Proc. ACM SIGGRAPH, pp. 351–358.
Wilmarth, S. A., Amato, N. M., and Stiller, P. F., 1999, “Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space,” Proc. ACM Symposium on Computational Geometry, pp. 173–180.
Choi,  H. I., Choi,  S. W., and Moon,  H. P., 1997, “Mathematical Theory of Medial Axis Transform,” Pac. J. Math., 181(1), pp. 56–88.
Donaghy, R. J., McCune, W., Bridgett, S. J., Armstrong, C. G., Robinson, D. J., and McKeag, R. M., 1996, “Dimensional Reduction of Analysis Models,” 5th International Meshing Roundtable, pp. 307–320.
Suresh, K., 2003, “Automating the CAD/CAE Dimensional Reduction Process,” Proc. ACM Symposium on Solid Modeling and Applications, pp. 76–85.
Armstrong, C. G., Robinson, D. J., McKeag, R. M., Li, T. S., Bridgett, S. J., Donaghy, R. J., and McGleenan, C. A., 1995, “Medials for Meshing and More,” 4th International Meshing Roundtable, pp. 277–288.
Quadros, W. R., Ramaswami, K., Prinz, F. B., and Gurumoorthy, B., 2000, “LayTracks: A New Approach to Automated Quadrilateral Mesh Generation using MAT,” 9th International Meshing Roundtable, pp. 239–250.

Figures

Grahic Jump Location
The separation angle S(x) for a point on the medial axis. The thick border is the boundary of X.
Grahic Jump Location
Computing the error bound. The angle subtended by p1and p2 is equal to θ, so no circle tangent only to the edges containing p1 and p2 is represented in Mθ. If the solid circle is enlarged into the dashed circle, then the vertex p will be included. The radius r is equal to the local radius R(p1)=R(p2).
Grahic Jump Location
Computing rext=‖p−x‖. The vector (p1−x) is a normal vector from x to a face on the boundary of X. There are two other such faces; the endpoints of the normal vectors to those faces, p2 and p3, are not shown. The point q bisects p1p2, which is one side of an equilateral triangle.
Grahic Jump Location
Disconnectedness. The point x is on the medial axis but has a small separation angle.
Grahic Jump Location
Different Θ-SMAs for the same model. As the separation angle increases, the number of high frequency or sharp components decreases.
Grahic Jump Location
The direction vectors at neighboring voxels can differ by a large angle even when the voxels are not on different sides of the medial axis.
Grahic Jump Location
The first step in an iterative refinement of the approximate θ-SMA. x is the initial guess, and p is the nearest neighbor of x on the boundary. Sx,p is the center centered on x and passing through p . There is a maximal circle Smax (not shown) that is contained in X and contains Sx,p. We approach the medial axis by approaching Smax.Smax touches the boundary in at least two places. p and p are successive approximations to the second point where Smax touches the boundary of X.
Grahic Jump Location
A torus and its θ-SMA. 2000 triangles. The grid resolution is 127×128×42.
Grahic Jump Location
The “primer anvil” for a shotgun shell. 4,340 triangles, SMA computed at 128×73×112 resolution. (a) The model. (b) The θ-SMA. The seams and boundary curves of the θ-SMA are shown.
Grahic Jump Location
Shotgun shell “charge” with 4460 triangles. The grid resolution is 126×128×126. (a) The model. (b) Cross section, showing different sheets in different shades.
Grahic Jump Location
Buddha model with 1,087,474 triangles. The grid resolution is 55×128×55.
Grahic Jump Location
Part of Cassini space probe model: Bus assembly. (a) The model. (b) Wireframe of the model with the θ-SMA shaded depending on the distance to the surface.
Grahic Jump Location
Skeleton hand with 654,666 triangles. The grid resolution is 79×106×127. No smoothing was performed.
Grahic Jump Location
Elbow pipe, at varying resolutions. (a) The model. Figures (b), (c) and (d), correspond to 128, 256, and 512 voxels along the longest side, respectively. The gap visible in (b) and (c) shows where the interior of the pipe model is separated by a surface into two compartments. The gap is not visible in (d) only because the angle of the scene is slightly different. The θ-SMA is not smoothed.
Grahic Jump Location
Bunny. 69,451 triangles, 128×126×100. (a) The bunny in wireframe, with the medial axis. (b) The θ-SMA.
Grahic Jump Location
Propulsion module of the Cassini spacecraft. 90,879 triangles, 94×128×96. (a) The model. (b) The model in cross section, with the θ-SMA shaded based on the distance to the boundary. In this example, the θ-SMA is not restricted to the interior of the model.

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