To access the full text documents, please follow this link: http://hdl.handle.net/2117/19397

The Reachability problem in constructive geometric constraint solving based dynamic geometry
Hidalgo Garcia, Marta; Joan Arinyo, Robert
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. GIE - Grup d´Informàtica a l´Enginyeria
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.
Àrees temàtiques de la UPC::Informàtica
Computational geometry
Dynamic geometry
Constructive geometric constraint solving
Reachability
Geometria computacional
info:eu-repo/semantics/publishedVersion
Article
         

Show full item record

Related documents

Other documents of the same author

Hidalgo Garcia, Marta; Joan Arinyo, Robert; Soto Riera, Antoni
Noguera, José María; Segura, Rafael; Ogáyar, Carlos; Joan Arinyo, Robert
Noguera, José María; Segura, Rafael; Ogáyar, Carlos; Joan Arinyo, Robert
Hoffmann, Christoph M.; Joan Arinyo, Robert
 

Coordination

 

Supporters