Automatic Cage Building with Quadric Error Metrics |
| |
Authors: | Zheng-Jie Deng Xiao-Nan Luo Xiao-Ping Miao |
| |
Affiliation: | (1) School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, 510006, China;(2) National Engineering Research Center of Digital Life, Guangzhou, 510006, China;(3) Research Institute of Sun Yat-Sen University in Shenzhen, Shenzhen, 518057, China;(4) School of Software, Sun Yat-Sen University, Guangzhou, 510006, China |
| |
Abstract: | Modern computer graphics applications usually require high resolution object models for realistic rendering. However, it is
expensive and difficult to deform such models in real time. In order to reduce the computational cost during deformations,
a dense model is often manipulated through a simplified structure, called cage, which envelops the model. However, cages are
usually built interactively by users, which is tedious and time-consuming. In this paper, we introduce a novel method that
can build cages automatically for both 2D polygons and 3D triangular meshes. The method consists of two steps: 1) simplifying
the input model with quadric error metrics and quadratic programming to build a coarse cage; 2) removing the self-intersections
of the coarse cage with Delaunay partitions. With this new method, a user can build a cage to envelop an input model either
entirely or partially with the approximate vertex number the user specifies. Experimental results show that, compared to other
cage building methods with the same number of vertex, cages built by our method are more similar to the input models. Thus,
the dense models can be manipulated with higher accuracy through our cages. |
| |
Keywords: | |
本文献已被 CNKI SpringerLink 等数据库收录! |
|