Priority-Based Geometric Constraint Satisfaction
نویسندگان
چکیده
A well-constrained geometric system seldom occurs in practice, especially at the sketchbased initial conceptual design stage. Usually, it is either underor overconstrained because design is a progressive process and it is difficult for a designer to specify all involved constraints in a consistent way. This paper presents a priority-based graphreduction solution, in which each constraint is assigned with a priority to guide the reduction of a geometric constraint graph. The advantage of this method lies in its ability to find the optimal solutions to a geometric constraint system automatically, without requiring interactive intervention from users. DOI: 10.1115/1.2795301
منابع مشابه
Solving Space Planning Problems Using Constraint Technology
Constraint programming techniques have proven their eeciency in solving high combinatory problems. In this paper, we study the adaptation , the extension and the limits of those techniques in the space planning problem which consists in nding the locations and the sizes of several objects under geometric constraints in a location space. For all that, we deene the formalism of Geometric Constrai...
متن کاملA New Structural Rigidity for Geometric Constraint Systems
The structural rigidity property, a generalization of Laman's theorem which characterizes rigid bar frameworks in 2D, is generally considered a good heuristic to detect rigidities in a geometric constraint satisfaction problem (GCSP). The gap between rigidity and structural rigidity essentially resides in the fact that structural rigidity is not a geometric property. In this article, we propose...
متن کاملAsynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application problems in Distributed Artificial Intelligence can be formalized as Distributed CSPs. We develop a new algorithm for solving Distributed CSPs called asynchronous weak-commitment search, which is inspired by the weak...
متن کاملAlgorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in geometric constraint satisfaction problems (GCSPs). However, it may fail even on simple GCSPs because it does not take geometric properties into account. In this paper, we question the flow-based algorithm used by Hoffm...
متن کاملConstraint-based feature recognition: handling non-uniqueness in feature interactions
The feature recognition problem is formulated as a geometric constraint satisfaction problem (GCSP), in which variables are the faces in the delta volume, the possible feature classiications determine values for the variables, and the constraints are the geometric and topological properties between the variables. A novel representation language is proposed to encode more, and somewhat redundant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007