A Convergent Convex Decomposition of Polyhedral Objects

[+] Author and Article Information
Yong Se Kim, D. J. Wilde

Design Division, Department of Mechanical Engineering, Stanford University, Stanford, CA 94305

J. Mech. Des 114(3), 468-476 (Sep 01, 1992) (9 pages) doi:10.1115/1.2926575 History: Received October 01, 1989; Revised December 01, 1990; Online June 02, 2008


A convex decomposition method, called Alternating Sum of Volumes (ASV), uses convex hulls and set difference operations. ASV decomposition, however, may not converge, which severely limits the domain of geometric objects that the current method can handle. We investigate the cause of non-convergence and present a remedy; we propose a new convex decomposition called Alternating Sum of Volumes with Partitioning (ASVP) and prove its convergence. ASVP decomposition is a hierarchical volumetric representation which is obtained from the boundary information of the given object based on convexity. As an application, from feature recognition by ASVP decomposition if briefly discussed.

Copyright © 1992 by The American Society of Mechanical Engineers
Topics: Surgery , Hull
Your Session has timed out. Please sign back in to continue.






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