Academic Journal
Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates
| العنوان: | Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates |
|---|---|
| المؤلفون: | Tamal K. Dey, Joshua A. Levine |
| المصدر: | Algorithms, Vol 2, Iss 4, Pp 1327-1349 (2009) |
| بيانات النشر: | MDPI AG, 2009. |
| سنة النشر: | 2009 |
| المجموعة: | LCC:Industrial engineering. Management engineering LCC:Electronic computers. Computer science |
| مصطلحات موضوعية: | Delaunay refinement, mesh generation, piecewise-smooth complexes, non-smoothness, non-manifoldness, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 1999-4893 |
| Relation: | http://www.mdpi.com/1999-4893/2/4/1327/; https://doaj.org/toc/1999-4893 |
| DOI: | 10.3390/a2041327 |
| URL الوصول: | https://doaj.org/article/e9f0ac6cc0d94a008142c71d8123ecb5 |
| رقم الانضمام: | edsdoj.9f0ac6cc0d94a008142c71d8123ecb5 |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 19994893 |
|---|---|
| DOI: | 10.3390/a2041327 |