Tetrahedrizing point sets in three dimensions
From MaRDI portal
Publication:2638826
DOI10.1016/S0747-7171(08)80068-5zbMath0717.68101MaRDI QIDQ2638826
Franco P. Preparata, Douglas B. West, Herbert Edelsbrunner
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (max. 100)
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees ⋮ Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models ⋮ Constrained paths in the flip-graph of regular triangulations ⋮ Unnamed Item ⋮ Conservative interpolation between volume meshes by local Galerkin projection ⋮ On the difficulty of triangulating three-dimensional nonconvex polyhedra ⋮ Empty monochromatic simplices ⋮ Approximating constrained tetrahedrizations ⋮ An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver ⋮ Computational Geometry Methods and Intelligent Computing ⋮ Triangulating point sets in space ⋮ Fast Delaunay triangulation in three dimensions ⋮ Unnamed Item ⋮ Construction of three-dimensional Delaunay triangulations using local transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of d-dimensional Voronoi diagrams
- On triangulations of the convex hull of n points
- Voronoi diagrams and arrangements
- Edge-skeletons in arrangements with applications
- A note on the all nearest-neighbor problem for convex polygons
- Triangulating point sets in space
- On the computational power of pushdown automata
- An apporach to automatic three-dimensional finite element mesh generation
- Optimal Point Location in a Monotone Subdivision
- A Note on Locating a Set of Points in a Planar Subdivision
- Convex hulls of finite sets of points in two and three dimensions
This page was built for publication: Tetrahedrizing point sets in three dimensions