Decision Complexity in Dynamic Geometry Extended Abstract
Ulrich Kortenkamp, Jürgen Richter-Gebert · 2000
Geometric straight-line programs [6, 10] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding whether two instances of the same geometric straight-line program are connected by a continuous path, the Complex Reachability Problem.