Skip to main content
Conference Proceedings

On the decidability of Tracing Problems in Dynamic Geometry

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3763 LNAI 111-120
DOI: 10.1007/11615798_8
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate two important problems arising in Dynamic Geometry, the Tracing Problem and the Reachability Problem. After presenting purely algebraic algorithms for these problems, we give an alternative approach. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Denner-Broser, B. (2006). On the decidability of Tracing Problems in Dynamic Geometry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3763 LNAI, pp. 111–120). https://doi.org/10.1007/11615798_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free