The Reachability Problem in Constructive Geometric Constraint Solving Based Dynamic Geometry
Journal of Automated Reasoning(2013)
摘要
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.
更多查看译文
关键词
Dynamic geometry,Constructive geometric constraint solving,Reachability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要