Decision complexity in Dynamic Geometry

TitelDecision complexity in Dynamic Geometry
Publication TypeConference Paper
Year of Publication2001
AuthorsKortenkamp, U., & Richter-Gebert J.
EditorWang, D.
Conference NameProceedings of ADG 2000
PublisherSpringer-Verlag
Conference LocationHeidelberg
Schlüsselwörterrefereed
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.

URLhttp://kortenkamps.net/papers/2001/36_DecisionComplexity.pdf
Go to top