We propose an automatic PolyCube-Maps construction scheme. Firstly, input mesh is decomposed into a set of feature regions, and further split into patches. Then, each region is approximated by a simple basic polycube primitive with each patch mapped to a rectangular sub-surface of the basic polycube primitive which can be parameterized independently. After that, an iterative procedure is performed to improve the parameterization quality globally. By these steps, we can obtain the polycubic parameterization result efficiently. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lin, J., Jin, X., Fan, Z., & Wang, C. C. L. (2008). Automatic PolyCube-maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4975 LNCS, pp. 3–16). Springer Verlag. https://doi.org/10.1007/978-3-540-79246-8_1
Mendeley helps you to discover research relevant for your work.