<?xml version="1.0"?>
<dblp>
<article key="journals/dcg/ClarksonEGSW90" mdate="2011-05-24">
<author>Kenneth L. Clarkson</author>
<author>Herbert Edelsbrunner</author>
<author>Leonidas J. Guibas</author>
<author>Micha Sharir</author>
<author>Emo Welzl</author>
<title>Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.</title>
<pages>99-160</pages>
<year>1990</year>
<volume>5</volume>
<journal>Discrete &amp; Computational Geometry</journal>
<url>db/journals/dcg/dcg5.html#ClarksonEGSW90</url>
<ee>http://dx.doi.org/10.1007/BF02187783</ee>
</article>
</dblp>
