Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'Kenneth L. Clarkson' in GoogleThis author has not been identified. Look up 'Herbert Edelsbrunner' in GoogleThis author has not been identified. Look up 'Leonidas J. Guibas' in GoogleThis author has not been identified. Look up 'Micha Sharir' in GoogleThis author has not been identified. Look up 'Emo Welzl' in Google

runs on WebDSL