14 search results - page 1 / 3 » Another Paradigm for Geometric Constraints Solving |
CCCG
2006
13 years 6 months ago
2006
Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...
SAC
2008
ACM
13 years 4 months ago
2008
ACM
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...
SMA
2003
ACM
13 years 10 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
PPL
2006
13 years 4 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
APLAS
2003
ACM
13 years 10 months ago
2003
ACM
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which desc...