The Complexity of Cutting Complexes.
Chazelle, B. ; Edelsbrunner, Herbert ; J., Guibas Leonidas
Discrete & computational geometry, Tome 4 (1989), p. 139-182 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1989-01-01
EUDML-ID : urn:eudml:doc:131069 
@article{GDZPPN00036391X,
     title = {The Complexity of Cutting Complexes.},
     journal = {Discrete \& computational geometry},
     volume = {4},
     year = {1989},
     pages = {139-182},
     zbl = {0663.68055},
     url = {http://dml.mathdoc.fr/item/GDZPPN00036391X}
}

Chazelle, B.; Edelsbrunner, Herbert; J., Guibas Leonidas. The Complexity of Cutting Complexes.. Discrete & computational geometry, Tome 4 (1989) pp. 139-182. http://gdmltest.u-ga.fr/item/GDZPPN00036391X/