Calculating approximate curve arrangements using rounded arithmetic

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

9 Citations (Scopus)

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
VolumePart F130124
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

Other

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

Fingerprint

Planar Curves
Arrangement
Subdivide
Curve
Algebraic curve
Computer program listings
Reasoning
Class

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 (Vol. Part F130124, pp. 197-207). Association for Computing Machinery. https://doi.org/10.1145/73833.73856

Calculating approximate curve arrangements using rounded arithmetic. / Milenkovic, Victor.

Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989. Vol. Part F130124 Association for Computing Machinery, 1989. p. 197-207.

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

Milenkovic, V 1989, Calculating approximate curve arrangements using rounded arithmetic. in Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989. vol. Part F130124, Association for Computing Machinery, pp. 197-207, 5th Annual Symposium on Computational Geometry, SCG 1989, Saarbruchen, Germany, 6/5/89. https://doi.org/10.1145/73833.73856
Milenkovic V. Calculating approximate curve arrangements using rounded arithmetic. In Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989. Vol. Part F130124. Association for Computing Machinery. 1989. p. 197-207 https://doi.org/10.1145/73833.73856
Milenkovic, Victor. / Calculating approximate curve arrangements using rounded arithmetic. Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989. Vol. Part F130124 Association for Computing Machinery, 1989. pp. 197-207
@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",
year = "1989",
month = "6",
day = "5",
doi = "10.1145/73833.73856",
language = "English (US)",
volume = "Part F130124",
pages = "197--207",
booktitle = "Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Calculating approximate curve arrangements using rounded arithmetic

AU - Milenkovic, Victor

PY - 1989/6/5

Y1 - 1989/6/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84910944214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910944214&partnerID=8YFLogxK

U2 - 10.1145/73833.73856

DO - 10.1145/73833.73856

M3 - Conference contribution

VL - Part F130124

SP - 197

EP - 207

BT - Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989

PB - Association for Computing Machinery

ER -