Decision Complexity in Dynamic Geometry

Abstract. Geometric straight-line programs [5, 8] 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.

• Type: Conference
• Year: 2000
• Where: ADG
• Authors: Ulrich Kortenkamp, Jürgen Richter-Gebert
• Keywords: ADG 2000, Complex Reachability Problem, Geometric Constructions, Geometric Straight-line Program, Mathematics