کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
442062 692041 2011 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A topology-preserving optimization algorithm for polycube mapping
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
A topology-preserving optimization algorithm for polycube mapping
چکیده انگلیسی

We present an effective optimization framework to compute polycube mapping. Composed of a set of small cubes, a polycube well approximates the geometry of the free-form model yet possesses great regularity; therefore, it can serve as a nice parametric domain for free-form shape modeling and analysis. Generally, the more cubes are used to construct the polycube, the better the shape can be approximated and parameterized with less distortion. However, corner points of a polycube domain are singularities of this parametric representation, so a polycube domain having too many corners is undesirable. We develop an iterative algorithm to seek for the optimal polycube domain and mapping, with the constraint on using a restricted number of cubes (therefore restricted number of corner points). We also use our polycube mapping framework to compute an optimal common polycube domain for multiple objects simultaneously for lowly distorted consistent parameterization.

An optimal common polycube domain for multiple objects for consistent arameterization.Figure optionsDownload high-quality image (177 K)Download as PowerPoint slideHighlights
► An effective optimization framework to compute polycube mapping.
► An iterative algorithm to optimize polycube domain and mapping.
► Optimal common polycube for multiple objects for consistent parameterization.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 35, Issue 3, June 2011, Pages 639–649
نویسندگان
, , , , ,