The Reachability problem in constructive geometric constraint solving based dynamic geometry
An important issue in dynamic geometry is the reachability problem that asks whether there is a continuos 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 exi...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/91262 |
| Acceso en línea: | https://hdl.handle.net/2117/91262 |
| Access Level: | acceso abierto |
| Palabra clave: | Dynamic geometry Constructive geometric constraint solving Reachability Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | An important issue in dynamic geometry is the reachability problem that asks whether there is a continuos 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. |
|---|