کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
442716 692335 2009 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Persistence-based handle and tunnel loops computation revisited for speed up
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
Persistence-based handle and tunnel loops computation revisited for speed up
چکیده انگلیسی

Loops in surfaces associated with topological features such as handles and tunnels are important entities in many applications including surface parameterization, feature identification, and topological simplification. Recently, a persistent homology based algorithm has been proposed to compute them. The algorithm has several advantages including its simplicity, combinatorial nature and independence from computing other extra structures. In this paper, we propose changes to this loop computation algorithm based on some novel observations. These changes reduce the computation time of the algorithm dramatically. In particular, our experimental results show that the suggested changes achieve considerable speed up for large data sets without sacrificing loop qualities.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 33, Issue 3, June 2009, Pages 351–358
نویسندگان
, ,