Geometric constraints solving: some tracks
Proceedings of the 2006 ACM symposium on Solid and physical modeling
A framework for geometric constraint satisfaction problem
Proceedings of the 2006 ACM symposium on Applied computing
Formalizing Desargues' theorem in Coq using ranks
Proceedings of the 2009 ACM symposium on Applied Computing
Using invariance under the similarity group to solve geometric constraint systems
Computer-Aided Design
Solving geometric constraints invariant modulo the similarity group
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Formalizing projective plane geometry in Coq
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
| Hi-index | 0.00 |
Abstract: Many authors have so far studied the problem of geometric construction in CAD from a combinatorial point of view. The derived algorithms are efficient but not general enough. Moreover the problem of robustness is seldom mentioned. In this paper, we expose a logical framework of geometric construction which points out the difficulties to overcome in order to implement a correct geometric universe. We think that this precise study of the particularities of geometry is necessary to obtain a robust geometric solver.