@inproceedings{4cec834d74c142a68db2617ef81dc741,

title = "Calculating approximate curve arrangements using rounded arithmetic",

abstract = "We present here an algorithm for the curve arrangement problem: determine how a set of planar curves subdivides the plane. This algorithm uses rounded arithmetic and generates an approximate result. It can be applied to a broad class of planar curves, and it is based on a new definition of approximate curve arrangements. This result is an important step towards the creation of practical computer programs for reasoning about algebraic curves of high degree.",

author = "Victor Milenkovic",

note = "Funding Information: *Part of this research was done at Carnegie Mellon University and was supported by an IBM Manufacturing Research Fellowship. Authors{\textquoteright} address: Aiken Computation Lab, Harvard University, Cambridge MA 02138. Copyright: Copyright 2018 Elsevier B.V., All rights reserved.; 5th Annual Symposium on Computational Geometry, SCG 1989 ; Conference date: 05-06-1989 Through 07-06-1989",

year = "1989",

month = jun,

day = "5",

doi = "10.1145/73833.73856",

language = "English (US)",

series = "Proceedings of the Annual Symposium on Computational Geometry",

publisher = "Association for Computing Machinery",

pages = "197--207",

booktitle = "Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989",

}