By Topic

Approximating solid objects by ellipsoid-tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Shengjun Liu ; Sch. of Math. & Comput. Technol., Central South Univ., Changsha, China ; Wang, Charlie C.L. ; Kin-Chuen Hui ; Xiaogang Jin
more authors

This paper presents an algorithm to approximate a solid model by a hierarchical set of bounding ellipsoids having optimal shape and volume approximation errors. The ellipsoid-tree is constructed in a top-down splitting framework. Starting from the root of hierarchy the volume occupied by a given model is divided into k sub-volumes where each is approximated by a volume bounding ellipsoid and will be later subdivided into k ellipsoids for the next level in hierarchy. The difficulty for implementing this algorithm comes from how to evaluate the volume of an ellipsoid outside the given model effectively and efficiently (i.e., the outside-volume-error). A new method - analytical computation based - is presented in this paper to compute the outside-volume-error. One application of ellipsoid-tree approximation has also been given at the end of the paper.

Published in:

Computer-Aided Design and Computer Graphics, 2009. CAD/Graphics '09. 11th IEEE International Conference on

Date of Conference:

19-21 Aug. 2009