بحث بعنوان Efficiently Hex-Meshing Things with Topology

بحث بعنوان Efficiently Hex-Meshing Things with Topology
اسم المؤلف
Jeff Erickson
التاريخ
21 أكتوبر 2020
المشاهدات
التقييم
(لا توجد تقييمات)
Loading...

بحث بعنوان
Efficiently Hex-Meshing Things with Topology
Jeff Erickson
Department of Computer Science
3 Submitted to Discrete & Computational Geometry
4 Revised and resubmitted
5 Abstract
6 A topological quadrilateral mesh Q of a connected surface in R3 can be extended to a
7 topological hexahedral mesh of the interior domain Ω if and only if Q has an even number
8 of quadrilaterals and no odd cycle in Q bounds a surface inside Ω. Moreover, if such a mesh
9 exists, the required number of hexahedra is within a constant factor of the minimum number
10 of tetrahedra in a triangulation of Ω that respects Q. Finally, if Q is given as a polyhedron
11 in R3 with quadrilateral facets, a topological hexahedral mesh of the polyhedron can be
12 constructed in polynomial time if such a mesh exists. All our results extend to domains with
13 disconnected boundaries. Our results naturally generalize results of Thurston, Mitchell, and
كلمة سر فك الضغط : books-world.net

The Unzip Password : books-world.net

تحميل

يجب عليك التسجيل في الموقع لكي تتمكن من التحميل
تسجيل | تسجيل الدخول

التعليقات

اترك تعليقاً