Kinetic and Dynamic Delaunay tetrahedralizations in three dimensions
| dc.creator | Schaller, Gernot | |
| dc.creator | Meyer-Hermann, Michael | |
| dc.date | 2003-02-06 | |
| dc.date | 2003-08-18 | |
| dc.date.accessioned | 2026-07-07T09:58:47Z | |
| dc.date.available | 2026-07-07T09:58:47Z | |
| dc.description | We describe the implementation of algorithms to construct and maintain three-dimensional dynamic Delaunay triangulations with kinetic vertices using a three-simplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tessellation. Initially, a given list of points is triangulated. Time evolution of the triangulation is not only governed by kinetic vertices but also by a changing number of vertices. We use three-dimensional simplex flip algorithms, a stochastic visibility walk algorithm for point location and in addition, we propose a new simple method of deleting vertices from an existing three-dimensional Delaunay triangulation while maintaining the Delaunay property. The dual Dirichlet tessellation can be used to solve differential equations on an irregular grid, to define partitions in cell tissue simulations, for collision detection etc. | |
| dc.description | 29 pg (preprint), 12 figures, 1 table Title changed (mainly nomenclature), referee suggestions included, typos corrected, bibliography updated | |
| dc.identifier | https://arxiv.org/abs/physics/0302018 | |
| dc.identifier | http://arxiv.org/abs/physics/0302018 | |
| dc.identifier | Computer Physics Communications 162, 9-23 (2004) | |
| dc.identifier | doi:10.1016/j.cpc.2004.06.066 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167846 | |
| dc.subject | Biological Physics | |
| dc.subject | Computational Physics | |
| dc.title | Kinetic and Dynamic Delaunay tetrahedralizations in three dimensions | |
| dc.type | text |