Abstract
Many problems arising in real geometry can be formulated as first-order formulas. Thus quantifier elimination can be used to solve these problems. In this note, we discuss the applicability of implemented quantifier elimination algorithms for solving geometrical problems. In particular, we demonstrate how the tools of redlog can be applied to solve a real implicitization problem, namely the Enneper surface.
Cite
CITATION STYLE
Dolzmann, A. (1999). Solving geometric problems with real quantifier elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1669, pp. 14–29). Springer Verlag. https://doi.org/10.1007/3-540-47997-x_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
