Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic

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

29 Citations (Scopus)

Abstract

For the first time it is shown how to reduce the cost of performing specific geometric constructions by using rounded arithmetic instead of exact arithmetic. By exploiting a property of floating-point arithmetic called monotonicity, a technique called double-precision geometry can replace exact arithmetic with rounded arithmetic in any efficient algorithm for computing the set of intersections of a set of lines or line segments. The technique reduces the complexity of any such line or segment arrangement algorithm by a constant factor. In addition, double-precision geometry reduces by a factor of N the complexity of rendering segment arrangements on a 2N × 2N integer grid such that output segments have grid points as endpoints.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages500-505
Number of pages6
ISBN (Print)0818619821
StatePublished - Nov 1989
Externally publishedYes
Event30th Annual Symposium on Foundations of Computer Science - Research Triangle Park, NC, USA
Duration: Oct 30 1989Nov 1 1989

Other

Other30th Annual Symposium on Foundations of Computer Science
CityResearch Triangle Park, NC, USA
Period10/30/8911/1/89

Fingerprint

Digital arithmetic
Geometry
Costs

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Milenkovic, V. (1989). Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 500-505). Publ by IEEE.

Double precision geometry : A general technique for calculating line and segment intersections using rounded arithmetic. / Milenkovic, Victor.

Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1989. p. 500-505.

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

Milenkovic, V 1989, Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic. in Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, pp. 500-505, 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 10/30/89.
Milenkovic V. Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic. In Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE. 1989. p. 500-505
Milenkovic, Victor. / Double precision geometry : A general technique for calculating line and segment intersections using rounded arithmetic. Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1989. pp. 500-505
@inproceedings{9bf905d71c214cb2850bd750d88b1d0a,
title = "Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic",
abstract = "For the first time it is shown how to reduce the cost of performing specific geometric constructions by using rounded arithmetic instead of exact arithmetic. By exploiting a property of floating-point arithmetic called monotonicity, a technique called double-precision geometry can replace exact arithmetic with rounded arithmetic in any efficient algorithm for computing the set of intersections of a set of lines or line segments. The technique reduces the complexity of any such line or segment arrangement algorithm by a constant factor. In addition, double-precision geometry reduces by a factor of N the complexity of rendering segment arrangements on a 2N × 2N integer grid such that output segments have grid points as endpoints.",
author = "Victor Milenkovic",
year = "1989",
month = "11",
language = "English (US)",
isbn = "0818619821",
pages = "500--505",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Double precision geometry

T2 - A general technique for calculating line and segment intersections using rounded arithmetic

AU - Milenkovic, Victor

PY - 1989/11

Y1 - 1989/11

N2 - For the first time it is shown how to reduce the cost of performing specific geometric constructions by using rounded arithmetic instead of exact arithmetic. By exploiting a property of floating-point arithmetic called monotonicity, a technique called double-precision geometry can replace exact arithmetic with rounded arithmetic in any efficient algorithm for computing the set of intersections of a set of lines or line segments. The technique reduces the complexity of any such line or segment arrangement algorithm by a constant factor. In addition, double-precision geometry reduces by a factor of N the complexity of rendering segment arrangements on a 2N × 2N integer grid such that output segments have grid points as endpoints.

AB - For the first time it is shown how to reduce the cost of performing specific geometric constructions by using rounded arithmetic instead of exact arithmetic. By exploiting a property of floating-point arithmetic called monotonicity, a technique called double-precision geometry can replace exact arithmetic with rounded arithmetic in any efficient algorithm for computing the set of intersections of a set of lines or line segments. The technique reduces the complexity of any such line or segment arrangement algorithm by a constant factor. In addition, double-precision geometry reduces by a factor of N the complexity of rendering segment arrangements on a 2N × 2N integer grid such that output segments have grid points as endpoints.

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

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

M3 - Conference contribution

AN - SCOPUS:0024765832

SN - 0818619821

SP - 500

EP - 505

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

ER -