DocumentCode :
2184696
Title :
Finite-resolution computational geometry
Author :
Greene, Daniel H. ; Yao, Frances F.
fYear :
1986
fDate :
27-29 Oct. 1986
Firstpage :
143
Lastpage :
152
Abstract :
Geometric algorithms are usually designed with continuous parameters in mind. When the underlying geometric space is intrinsically discrete, as is the case for computer graphics problems, such algorithms are apt to give invalid solutions if properties of a finite-resolution space are not taken into account. In this paper we discuss an approach for transforming geometric concepts and algorithms from the continuous domain to the discrete domain. As an example we consider the discrete version of the problem of finding all intersections of a collection of line segments. We formulate criteria for a satisfactory solution to this problem, and design an interface between the continuous domain and the discrete domain which supports certain invariants. This interface enables us to obtain a satisfactory solution by using plane-sweep and a variant of the continued fraction algorithm.
Keywords :
Algorithm design and analysis; Application software; Computational geometry; Computer graphics; Concrete; Solid modeling; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1986., 27th Annual Symposium on
Conference_Location :
Toronto, ON, Canada
ISSN :
0272-5428
Print_ISBN :
0-8186-0740-8
Type :
conf
DOI :
10.1109/SFCS.1986.19
Filename :
4568205
Link To Document :
بازگشت