International audienceWe consider constraints satisfaction problems between lines in Euclidean geometry. Our language of constraints is based on the binary relation of parallelism. Our main results state that (1) solving constraints between lines in dimension 2 can be done in polynomial time whereas (2) solving constraints between lines in dimension 3 is NP-hard
International audienceSolving Geometrical Constraint Systems Using CLP Based on Linear Constraint So...
Abstract. An input to the betweenness problem contains m constraints over n real variables (points)....
Abstract. We propose a geometric constraint solving method based on connectivity analysis in graph t...
We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint s...
Geometric constraint solving has applications in a wide variety of fields, such as mechanical engine...
Geometric constraint solving is a growing field devoted to solve geometric problems defined by relat...
This work investigates 3D geometric constraint solving for a representative class of basic problems ...
Current parametric CAD systems are based on solving equality types of constraints between geometric ...
Abstract. This paper proposes two algorithms for solving geometric constraint systems. The first alg...
In the paper, a new constructive approach to solving geometric constraints in 2D space is presented....
Motivated by applications in Computer Aided Design (CAD) and biology, we investigate geometric const...
In the paper, a new constructive approach to solving geometric constraints in 2D space is presented....
This paper reports on solving geometric constraint satisfaction problems involving incidence and tan...
In parametric design, changing values of parameters to get different solution instances to the probl...
International audienceThis paper is about one representation of constructible numbers which allows u...
International audienceSolving Geometrical Constraint Systems Using CLP Based on Linear Constraint So...
Abstract. An input to the betweenness problem contains m constraints over n real variables (points)....
Abstract. We propose a geometric constraint solving method based on connectivity analysis in graph t...
We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint s...
Geometric constraint solving has applications in a wide variety of fields, such as mechanical engine...
Geometric constraint solving is a growing field devoted to solve geometric problems defined by relat...
This work investigates 3D geometric constraint solving for a representative class of basic problems ...
Current parametric CAD systems are based on solving equality types of constraints between geometric ...
Abstract. This paper proposes two algorithms for solving geometric constraint systems. The first alg...
In the paper, a new constructive approach to solving geometric constraints in 2D space is presented....
Motivated by applications in Computer Aided Design (CAD) and biology, we investigate geometric const...
In the paper, a new constructive approach to solving geometric constraints in 2D space is presented....
This paper reports on solving geometric constraint satisfaction problems involving incidence and tan...
In parametric design, changing values of parameters to get different solution instances to the probl...
International audienceThis paper is about one representation of constructible numbers which allows u...
International audienceSolving Geometrical Constraint Systems Using CLP Based on Linear Constraint So...
Abstract. An input to the betweenness problem contains m constraints over n real variables (points)....
Abstract. We propose a geometric constraint solving method based on connectivity analysis in graph t...
DOI
Add to ORKG