Calculating approximate curve arrangements using rounded arithmetic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989
PublisherAssociation for Computing Machinery
Pages197-207
Number of pages11
ISBN (Electronic)0897913183
DOIs
StatePublished - Jun 5 1989
Externally publishedYes
Event5th Annual Symposium on Computational Geometry, SCG 1989 - Saarbruchen, Germany
Duration: Jun 5 1989Jun 7 1989

Publication series

NameProceedings of the Annual Symposium on Computational Geometry
VolumePart F130124

Other

Other5th Annual Symposium on Computational Geometry, SCG 1989
CountryGermany
CitySaarbruchen
Period6/5/896/7/89

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Cite this

Milenkovic, V. (1989). Calculating approximate curve arrangements using rounded arithmetic. In Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989 (pp. 197-207). (Proceedings of the Annual Symposium on Computational Geometry; Vol. Part F130124). Association for Computing Machinery. https://doi.org/10.1145/73833.73856