On computing the dual of a plane algebraic curve
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Computation of the dual of a plane projective curve
Journal of Symbolic Computation
Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases
AAECC-5 Proceedings of the 5th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Algorithms to compute the topology of orientable real algebraic surfaces
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Algorithmical determination of the topology of a real algebraic surface
Journal of Symbolic Computation
Hi-index | 0.00 |
We address two basic questions for real algebraic curves. The first one is how to decide whether a real algebraic curve in the n-projective space contains some real point. We present an algorithm that reduces the original question to deciding whether the zero-set of a zero-dimensional ideal contains real points. The second part of the paper is devoted to giving necessary and sufficient conditions for the existence of a real line disjoint from a given real plane algebraic curve. An algorithm for testing whether these conditions are fulfilled is given. are fulfilled is given.