Algebraic solution for geometry from dimensional constraints
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Solving geometric constraints by homotopy
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Formal resolution of geometrical constraint systems by assembling
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Geometric construction by assembling solved subfigures
Artificial Intelligence
Constructing three-dimensional geometric objects defined by constraints
I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
Sketch-based pruning of a solution space within a formal geometric constraint solver
Artificial Intelligence
Decomposition plans for geometric constraint problems, part II: new algorithms
Journal of Symbolic Computation
Solving spatial basic geometric constraint configurations with locus intersection
Proceedings of the seventh ACM symposium on Solid modeling and applications
A Case Study in Geometric Constructions
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Robustness in CAD Geometric Constructions
IV '01 Proceedings of the Fifth International Conference on Information Visualisation
Symbolic and numerical techniques for constraint solving
Symbolic and numerical techniques for constraint solving
Numerical decomposition of geometric constraints
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Using invariance under the similarity group to solve geometric constraint systems
Computer-Aided Design
| Hi-index | 0.00 |
In the area of Computer Aided Design (CAD), the geometric constraint systems considered are invariant under the direct isometry group. We show that the invariance under the direct similarity group also leads to interesting problems even in the CAD domain. This paper describes a method to solve such problems in the case of angle constraints involving three points. This method relies on extensions of euclidean notions described in earlier work and can be used in combination with other solvers.