Tetrahedrizing point sets in three dimensions

DOI10.1016/S0747-7171(08)80068-5MaRDI QIDQ2638826zbMATH OpenFDO

Authors F. P. Preparata, Douglas B. West, Herbert Edelsbrunner

Publication date 1990

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0747-7171(08)80068-5

zbMATH Keywords

tetrahedrization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 6381744
• scientific article; zbMATH DE number 1555973
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
• Triangulating point sets in space
• Hamiltonian tetrahedralizations with Steiner points

Cites work

• A Note on Locating a Set of Points in a Planar Subdivision
• A note on the all nearest-neighbor problem for convex polygons
• An apporach to automatic three-dimensional finite element mesh generation
• Convex hulls of finite sets of points in two and three dimensions
• Edge-skeletons in arrangements with applications
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3438337 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 3272188 (Why is no real title available?)
• scientific article; zbMATH DE number 3086072 (Why is no real title available?)
• On the complexity of d-dimensional Voronoi diagrams
• On the computational power of pushdown automata
• On triangulations of the convex hull of n points
• Optimal Point Location in a Monotone Subdivision
• Triangulating point sets in space
• Voronoi diagrams and arrangements

Cited in

(28)

• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Approximating constrained tetrahedrizations
• Hamiltonian tetrahedralizations with Steiner points
• Triangulating point sets in space
• Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models
• Empty monochromatic simplices
• Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
• Fast Delaunay triangulation in three dimensions
• scientific article; zbMATH DE number 1696645 (Why is no real title available?)
• scientific article; zbMATH DE number 1728310 (Why is no real title available?)
• Sets of tetrahedra, defined by maxima of distance functions
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
• Computational Geometry Methods and Intelligent Computing
• ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
• COMPUTATIONAL GEOMETRY COLUMN 23
• scientific article; zbMATH DE number 741009 (Why is no real title available?)
• scientific article; zbMATH DE number 1979508 (Why is no real title available?)
• scientific article; zbMATH DE number 1555973 (Why is no real title available?)
• From image to video approximation by adaptive splines over tetrahedralizations
• Detecting tetrahedralizations of a set of line segments
• 2-toroids and their 3-triangulation
• On the size of higher-dimensional triangulations
• Conservative interpolation between volume meshes by local Galerkin projection
• Bounded-degree polyhedronization of point sets
• 3-triangulations of polyhedra and their connection graphs
• An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver
• Construction of three-dimensional Delaunay triangulations using local transformations
• Constrained paths in the flip-graph of regular triangulations

This page was built for publication: Tetrahedrizing point sets in three dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638826)