Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Decomposition plans for geometric constraint systems, part I: performance measures for CAD
Journal of Symbolic Computation
Decomposition plans for geometric constraint problems, part II: new algorithms
Journal of Symbolic Computation
Internet Routing Architectures, Second Edition
Internet Routing Architectures, Second Edition
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
On the Domain of Constructive Geometric Constraint Solving Techniques
SCCG '01 Proceedings of the 17th Spring conference on Computer graphics
An algorithm for the tracing problem using interval analysis
Proceedings of the 2008 ACM symposium on Applied computing
Proceedings of the 3rd International Workshop on Reachability Problems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
A correct rule-based geometric constraint solver
Computers and Graphics
A constraint-based dynamic geometry system
Computer-Aided Design
On the decidability of tracing problems in dynamic geometry
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
| Hi-index | 0.00 |
An important issue in dynamic geometry is the reachability problem that asks whether there is a continuous path that, from a given starting geometric configuration, continuously leads to an ending configuration. In this work we report on a technique to compute a continuous evaluation path, if one exists, that solves the reachability problem for geometric constructions with one variant parameter. The technique is developed in the framework of a constructive geometric constraint-based dynamic geometry system, uses the A驴驴驴 algorithm and minimizes the variant parameter arc length.