%0 Conference Paper %1 conf/focs/ClarksonEGSW88 %A Clarkson, Kenneth L. %A Edelsbrunner, Herbert %A Guibas, Leonidas J. %A Sharir, Micha %A Welzl, Emo %B FOCS %D 1988 %I IEEE Computer Society %K dblp %P 568-579 %T Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces %U http://dblp.uni-trier.de/db/conf/focs/focs88.html#ClarksonEGSW88 %@ 0-8186-0877-3

@inproceedings{conf/focs/ClarksonEGSW88, added-at = {2023-03-23T00:00:00.000+0100}, author = {Clarkson, Kenneth L. and Edelsbrunner, Herbert and Guibas, Leonidas J. and Sharir, Micha and Welzl, Emo}, biburl = {https://www.bibsonomy.org/bibtex/2bf7077e54d3edaf8d425a5ac50c3d7c3/dblp}, booktitle = {FOCS}, crossref = {conf/focs/FOCS29}, ee = {https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21973}, interhash = {23c1088428ccd018c82b30bc15fc5347}, intrahash = {bf7077e54d3edaf8d425a5ac50c3d7c3}, isbn = {0-8186-0877-3}, keywords = {dblp}, pages = {568-579}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T10:20:52.000+0200}, title = {Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces}, url = {http://dblp.uni-trier.de/db/conf/focs/focs88.html#ClarksonEGSW88}, year = 1988 }