Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
From MaRDI portal
Publication:709578
Abstract: 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.
Recommendations
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- Kinetic convex hulls and Delaunay triangulations in the black-box model
- Kinetic stable Delaunay graphs
- Triangles and tetrahedra in explicit dynamic codes for solids
- scientific article; zbMATH DE number 1225873
- Dynamics of triangulations
- Robust Kinetic Convex Hulls in 3D
Cites work
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 1263247 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1049272 (Why is no real title available?)
- scientific article; zbMATH DE number 1182913 (Why is no real title available?)
- scientific article; zbMATH DE number 1944194 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 1756100 (Why is no real title available?)
- A Robust Implementation for Three-Dimensional Delaunay Triangulations
- A note on point location in Delaunay triangulations of random points
- A three-dimensional vertex dynamics cell model of space-filling polyhedra simulating cell behavior in a cell aggregate
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Dynamical geometry for multiscale dissipative particle dynamics
- Geometric relations among Voronoi diagrams
- Incremental topological flipping works for regular triangulations
- ON DELETION IN DELAUNAY TRIANGULATIONS
- On the randomized construction of the Delaunay tree
- Regular triangulations of dynamic sets of points
- Walking in a triangulation
Cited in
(11)- A novel video compression scheme based on kinetic Delaunay triangulation
- Dynamic T‐search for accelerating searching speeds in Delaunay triangulation
- A kinematic approach to Kokotsakis meshes
- Generalized Voronoi tessellation as a model of two-dimensional cell tissue dynamics
- Vertex deletion for 3D Delaunay triangulations
- 3D kinetic alpha complexes and their implementation
- Kinetic stable Delaunay graphs
- Formulation and computation of dynamic, interface-compatible Whitney complexes in three dimensions
- A modelling approach towards epidermal homoeostasis control
- Surface reconstruction using Delaunay triangulation for applications in life sciences
- scientific article; zbMATH DE number 7576806 (Why is no real title available?)
This page was built for publication: Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709578)
