Tetrahedrizing point sets in three dimensions

Authors:
H. Edelsbrunner;F. P. Preparata;D. B. West
Affiliations:
Department of Computer Science;Co-ordinated Science Laboratory and Departments of Electrical & Computer Engineering and of Computer Science;Co-ordinated Science Laboratory and Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
Venue:
Journal of Symbolic Computation
Year:
1990

Citing 5
Cited 15

Rotation distance, triangulations, and hyperbolic geometry

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Voronoi diagrams and arrangements

Discrete & Computational Geometry
Optimal point location in a monotone subdivision

SIAM Journal on Computing
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Visibility-ordering meshed polyhedra

ACM Transactions on Graphics (TOG)
Compatible tetrahedralizations

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Pyramidal simplicial complexes

SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Finding minimal triangulations of convex 3-polytopes is NP-hard

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation for minimum triangulation of convex polyhedra

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computational geometry

ACM SIGACT News
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithms and Complexity for Tetrahedralization Detections

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Tetrahedralization of Two Nested Convex Polyhedra

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
The complexity of finding small triangulations of convex 3-polytopes

Journal of Algorithms - Special issue: SODA 2000
Detecting tetrahedralizations of a set of line segments

Journal of Algorithms
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees

Computational Geometry: Theory and Applications
Constrained paths in the flip-graph of regular triangulations

Computational Geometry: Theory and Applications
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees

Computational Geometry: Theory and Applications
Compatible Tetrahedralizations

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.