A Direct Approach to Computing theμ-basis of Planar Rational Curves

23Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents an O(n2) algorithm, based on Gröbner basis techniques, to compute the μ -basis of a degree n planar rational curve. The prior method involved solving a set of linear equations whose complexity by standard numerical methods was O(n3). The μ -basis is useful in computing the implicit equation of a parametric curve and can express the implicit equation in the form of a determinant that is smaller than that obtained by taking the resultant of the parametric equations. © 2001 Academic Press.

References Powered by Scopus

Implicitization using moving curves and surfaces

161Citations
26Readers
Get full text
113Citations
10Readers
Get full text
76Citations
5Readers

This article is free to access.

Cited by Powered by Scopus

This article is free to access.

Get full text

Computing μ-bases of rational curves and surfaces using polynomial matrix factorization

30Citations
8Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Zheng, J., & Sederberg, T. W. (2001). A Direct Approach to Computing theμ-basis of Planar Rational Curves. Journal of Symbolic Computation, 31(5), 619–629. https://doi.org/10.1006/jsco.2001.0437

Readers over time

‘11‘12‘16‘18‘1900.511.52

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

67%

Professor / Associate Prof. 1

33%

Readers' Discipline

Tooltip

Mathematics 2

50%

Engineering 2

50%

Save time finding and organizing research with Mendeley

Sign up for free
0