Tetrahedrizing point sets in three dimensions

H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10 (1990) 335–347.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Author
; ;
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.
Publishing Year
Date Published
1990-01-01
Journal Title
Journal of Symbolic Computation
Volume
10
Issue
3-4
Page
335 - 347
IST-REx-ID

Cite this

Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 1990;10(3-4):335-347. doi:10.1016/S0747-7171(08)80068-5
Edelsbrunner, H., Preparata, F., & West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation, 10(3–4), 335–347. https://doi.org/10.1016/S0747-7171(08)80068-5
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation 10, no. 3–4 (1990): 335–47. https://doi.org/10.1016/S0747-7171(08)80068-5.
H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” Journal of Symbolic Computation, vol. 10, no. 3–4, pp. 335–347, 1990.
Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar