A direct approach to computing the \(\mu\)-basis of planar rational curves
DOI10.1006/jsco.2001.0437zbMath0978.65008OpenAlexW2055431849MaRDI QIDQ5938549
Thomas W. Sederberg, Jianmin Zheng
Publication date: 22 July 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4b8cb90d8d66c661071a28a7ff132a71333f4e6f
algorithmcomputational complexitynumerical exampleparametrizationGröbner basesimplicitization\(\mu\)-basisconic sectionplanar rational curves
Rational points (14G05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Complexity and performance of numerical algorithms (65Y20)
Related Items (17)
Cites Work
- An implicitization algorithm with fewer variables
- The Cayley method in computer aided geometric design
- Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- Symbolic parametrization of curves
- Implicitization of rational parametric equations
- The moving line ideal basis of planar rational curves
- Implicitization of parametric curves and surfaces by using multidimensional Newton formulae
- Implicitizing rational curves by the method of moving algebraic curves
- Curve implicitization using moving lines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A direct approach to computing the \(\mu\)-basis of planar rational curves