2003
DOI: 10.1090/conm/334/05988
|View full text |Cite
|
Sign up to set email alerts
|

Using projection operators in computer aided geometric design

Abstract: We give an overview of resultant theory and some of its applications in computer aided geometric design. First, we mention different formulations of resultants, including the projective resultant, the toric resultant, and the residual resultants. In the second part we illustrate these tools, and others projection operators, on typical problems as surface implicitization, inversion, intersection, and detection of singularities of a parameterized surface.ki j=0 c i,j ψ i,j (x) = 0 for i = 0, . . . , n. In other … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(25 citation statements)
references
References 27 publications
0
25
0
Order By: Relevance
“…• adjoint multiplication maps M * h 2 : S * 2 (a2 + b2) → S * 2 (a2) with λ → h2 · λ, expressing the action of a polynomial h2 ∈ S2(b2), as defined in (10).…”
Section: Primal-dual Multiplication Mapsmentioning
confidence: 99%
See 1 more Smart Citation
“…• adjoint multiplication maps M * h 2 : S * 2 (a2 + b2) → S * 2 (a2) with λ → h2 · λ, expressing the action of a polynomial h2 ∈ S2(b2), as defined in (10).…”
Section: Primal-dual Multiplication Mapsmentioning
confidence: 99%
“…We refer the reader to [32] as a basic reference, to [13] for a nice introduction to the theory of resultants, to [10] for its application in Computer-aided Geometric Design (CAGD), Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored.…”
Section: Introductionmentioning
confidence: 99%
“…. , f n (c, x) [5,Theorem 3.4] (see also [7,Theorem 3.7] for general statements). Therefore, if ∆(c) stands for the determinant of a maximal minor of the Bezoutian matrix of f 0 (c, x), .…”
Section: Overview On the Bezoutian Matrixmentioning
confidence: 99%
“…These operations still need to be improved and computer algebra techniques can help. Among them, generalized resultant (for instance sparse resultant) techniques have been successfully employed [18,19,7].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation