Bounds on the size of tetrahedralizations |
| |
| Authors: | B Chazelle N Shourboura |
| |
| Institution: | (1) Department of Computer Science, Princeton University, 08544 Princeton, NJ, USA;(2) Program in Applied and Computer Mathematics, Princeton University, 08544 Princeton, NJ, USA |
| |
| Abstract: | This paper gives lower and upper bounds on the complexity of triangulating the region between polyhedra. Particular attention
is given to the case of convex polyhedra and terrains.
The first author was suported in part by NSF Grant CCR-90-02352 and The Geometry Center, University of Minnesota, an STC funded
by NSF, DOE, and Minnesota Technology, Inc. The second author was supported in part by NSF Grant PHY-90-21984. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
