# The Complexity of Cutting Complexes.

B. Chazelle; Herbert Edelsbrunner; Guibas Leonidas J.

Discrete & computational geometry (1989)

- Volume: 4, Issue: 2, page 139-182
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topChazelle, B., Edelsbrunner, Herbert, and J., Guibas Leonidas. "The Complexity of Cutting Complexes.." Discrete & computational geometry 4.2 (1989): 139-182. <http://eudml.org/doc/131069>.

@article{Chazelle1989,

author = {Chazelle, B., Edelsbrunner, Herbert, J., Guibas Leonidas},

journal = {Discrete & computational geometry},

keywords = {computational geometry; combinatorial geometry; convex subdivision; three-dimensional convex polytope; extremal functions; polynomial algorithms},

number = {2},

pages = {139-182},

title = {The Complexity of Cutting Complexes.},

url = {http://eudml.org/doc/131069},

volume = {4},

year = {1989},

}

TY - JOUR

AU - Chazelle, B.

AU - Edelsbrunner, Herbert

AU - J., Guibas Leonidas

TI - The Complexity of Cutting Complexes.

JO - Discrete & computational geometry

PY - 1989

VL - 4

IS - 2

SP - 139

EP - 182

KW - computational geometry; combinatorial geometry; convex subdivision; three-dimensional convex polytope; extremal functions; polynomial algorithms

UR - http://eudml.org/doc/131069

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.