@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 = jan,

day = "1",

doi = "10.1109/sfcs.1989.63525",

language = "English (US)",

isbn = "0818619821",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "Publ by IEEE",

pages = "500--505",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

note = "30th Annual Symposium on Foundations of Computer Science ; Conference date: 30-10-1989 Through 01-11-1989",

}