Approzimating Solid Objects by Ellipsoid-Tree
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 ellipsoidtree 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-volumeerror). A new method-analytical computation based-is presented in this paper to compute the outside-volumeerror. One application of ellipsoid-tree approximation has also been given at the end of the paper.
Shengjun Liu Charlie C.L. Wang Kin-Chuen Hui Xiaogang Jin Hanli Zhao
School of Mathematics and Computing Technology Central South University, Changsha, P.R.China 410083 Department of Mechanical and Automation Engineering The Chinese University of Hong Kong, Hong Kong, State Key Lab of CAD&CG, Zhejiang University, Hangzhou, P.R.China
国际会议
黄山
英文
134-139
2009-08-19（万方平台首次上网日期，不代表论文的发表时间）