Robust construction of 3-d conforming delaunay meshes using arbitrary-precision arithmetic

N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An algorithm for the construction of 3-D conforming Delaunay tetrahe-dralizations is presented. The boundary of the meshed domain is contained within Voronoï cells of the boundary vertices of the resulting mesh. The algorithm is explained heuristically. It has been implemented. The problem of numerical precision is shown to be a major obstacle to robust implementation of the algorithm. The Automatic Arbitrary-Precision Arithmetic Library is introduced to solve this problem. The resulting program is intended to be applicable to any mathematically correct input. It has performed successfully on a number of test cases, including a known difficult case for tetrahedral meshing. It is available on the Internet. The Arithmetic Library may be useful for resolving numerical precision problems in any application, and as a base for experimenting with new meshing strategies. © 2005 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bogomolov, K. (2005). Robust construction of 3-d conforming delaunay meshes using arbitrary-precision arithmetic. In Proceedings of the 14th International Meshing Roundtable, IMR 2005 (pp. 183–201). Kluwer Academic Publishers. https://doi.org/10.1007/3-540-29090-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free