JOURNAL ARTICLE
Disjunctive constraint satisfaction over reals
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/sup 2/) and O(n/sup 3/) in two and three dimensions, respectively.< >
Keywords:
Constraint satisfaction problem Constraint (computer-aided design) Constraint satisfaction Computer science Theoretical computer science Discrete mathematics Combinatorics Mathematics Algorithm Mathematical optimization Artificial intelligence Geometry
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
15
Refs
0.17
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Computational Geometry and Mesh Generation
Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design
Digital Image Processing Techniques
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Constraint Satisfaction and Optimization
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Spatial synthesis by disjunctive constraint satisfaction
Journal: Artificial intelligence for engineering design analysis and manufacturing Year: 1997 Vol: 11 (4)Pages: 245-262
BOOK-CHAPTER
Disjunctive and Continuous Constraint Satisfaction Problems
Miguel Á. SalidoFederico Barber
Lecture notes in computer science Year: 2002 Pages: 768-769
JOURNAL ARTICLE
An Overview of Disjunctive Constraint Satisfaction
John T. MaxwellRonald M. Kaplan
Journal: International Workshop/Conference on Parsing Technologies Year: 1989 Vol: 9 (4)Pages: 18-27
BOOK-CHAPTER
A Method for Disjunctive Constraint Satisfaction
John T. MaxwellRonald M. Kaplan
Year: 1991 Pages: 173-190
BOOK-CHAPTER
Linear concurrent constraint programming over reals
Lecture notes in computer science Year: 1998 Pages: 400-416