Rights accessRestricted access - publisher's policy
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 constraintbased
dynamic geometry system, uses the A∗ algorithm and minimizes the variant
parameter arc length.
CitationHidalgo, M.; Joan-Arinyo, R. The Reachability problem in constructive geometric constraint solving based dynamic geometry. "Journal of automated reasoning", Març 2013, p. 1-24.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org