Bounds on the size of tetrahedralizations

Bernard Chazelle; N. Shourboura

doi:10.1007/BF02570716

Bounds on the size of tetrahedralizations

Bernard Chazelle, N. Shourboura

Computer Science

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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.

Original language	English (US)
Pages (from-to)	429-444
Number of pages	16
Journal	Discrete & Computational Geometry
Volume	14
Issue number	1
DOIs	https://doi.org/10.1007/BF02570716
State	Published - Dec 1 1995

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1007/BF02570716

Fingerprint Dive into the research topics of 'Bounds on the size of tetrahedralizations'. Together they form a unique fingerprint.

Cite this

@article{5450209f59c44b08a01cec586ee31500,

title = "Bounds on the size of tetrahedralizations",

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.",

author = "Bernard Chazelle and N. Shourboura",

year = "1995",

month = dec,

day = "1",

doi = "10.1007/BF02570716",

language = "English (US)",

volume = "14",

pages = "429--444",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Bounds on the size of tetrahedralizations

AU - Chazelle, Bernard

AU - Shourboura, N.

PY - 1995/12/1

Y1 - 1995/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51849182168&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51849182168&partnerID=8YFLogxK

U2 - 10.1007/BF02570716

DO - 10.1007/BF02570716

M3 - Article

AN - SCOPUS:51849182168

VL - 14

SP - 429

EP - 444

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 1

ER -