Automatizing geometric proofs and constructions
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
Algebraic solution for geometry from dimensional constraints
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Artificial Intelligence - Special volume on constraint-based reasoning
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
Sketch-based pruning of a solution space within a formal geometric constraint solver
Artificial Intelligence
Decomposition plans for geometric constraint systems, part I: performance measures for CAD
Journal of Symbolic Computation
Sketchpad: a man-machine graphical communication system
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
Solving geometric constraints invariant modulo the similarity group
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
| Hi-index | 0.00 |
The geometric constructions problem is often studied from a combinatorial point of view: a pair data structure + algorithm is proposed, and then one tries to determine the variety of geometric problems which can be solved. Conversely, we present here a different approach starting with the definition of a simple class of geometric construction problems and resulting in an algorithm and data structures. We show that our algorithm is correct, complete with respect to the class of simply constrained polygons, and has a linear complexity. The presented framework is very simple, but in spite of its simplicity, this algorithm can solve non-trivial problems.