Title :
Disjunctive constraint satisfaction over reals
Author :
Gaur, Daya Ram ; Havens, William S.
Author_Institution :
Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
Abstract :
Optimal algorithms are given for the disjunctive constraint satisfaction problem when the dimensions are two and three. These algorithms are based on techniques frequently used in computational geometry. The running times of the algorithms are O(n 2) and O(n3) in two and three dimensions, respectively
Keywords :
computational complexity; computational geometry; constraint handling; expert systems; computational geometry; disjunctive constraint satisfaction problem; optimal algorithms; running times; Computational geometry; Ear; Linear programming; Logic programming; Partitioning algorithms; Polynomials; Postal services;
Conference_Titel :
Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-0971-5
DOI :
10.1109/PACRIM.1993.407230
