Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces

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.

Abstract

Abstract is missing.