Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. In 29th Annual Symposium on Foundations of Computer Science, 24-26 October 1988, White Plains, New York, USA. pages 568-579, IEEE, 1988.
@inproceedings{ClarksonEGSW88,
title = {Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces},
author = {Kenneth L. Clarkson and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl},
year = {1988},
researchr = {https://researchr.org/publication/ClarksonEGSW88},
cites = {0},
citedby = {0},
pages = {568-579},
booktitle = {29th Annual Symposium on Foundations of Computer Science, 24-26 October 1988, White Plains, New York, USA},
publisher = {IEEE},
}