An efficient method for analyzing the topology of plane real algebraic curves
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Plotting missing points and branches of real parametric curves
Applicable Algebra in Engineering, Communication and Computing
Fast and exact geometric analysis of real algebraic plane curves
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Topology of 2D and 3D rational curves
Computer Aided Geometric Design
| Hi-index | 0.00 |
In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),@q(t)) where both r(t), @q(t) are rational functions. Our study includes theoretical aspects on the shape of these curves, and algorithmic results which eventually lead to an algorithm for plotting the ''interesting parts'' of the curve, i.e. the parts showing the main geometrical features.