Decision complexity in Dynamic Geometry

TitelDecision complexity in Dynamic Geometry
Publication TypeConference Paper
Year of Publication2000
AuthorsKortenkamp, U., & Richter-Gebert J.
EditorWang, D.
Conference NameProceedings of ADG 2000

Geometric straight-line programs [6, 10] can be used to model geo- metric 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.

Go to top