Abstract | ||
---|---|---|
Extending a geometric construction due to Sederberg and to Bajaj, Holt, and Netravali, an algorithm is presented for parameterizing a nonsingular cubic surface by polynomials of degree three. The fact that such a parametrization exists is classical. The present algorithm is, by its purely geometric nature, a very natural one. Moreover, it contains a practical way of finding all lines in an implicitly given cubic surface. Two explicit examples are presented, namely the classical Clebsch diagonal surface and the cubic Fermat surface. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1016/j.cagd.2009.06.001 | Computer Aided Geometric Design |
Keywords | Field | DocType |
cubic surface,explicit example,present algorithm,geometric construction,classical clebsch diagonal surface,nonsingular cubic surface,cubic fermat surface,geometric nature | Diagonal,Cubic surface,Topology,Combinatorics,Parametrization,Cubic form,Polynomial,Pure mathematics,Fermat's Last Theorem,Invertible matrix,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 8 | Computer Aided Geometric Design |
Citations | PageRank | References |
3 | 0.51 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Irene Polo-Blancoand | 1 | 4 | 1.57 |
Jaap Top | 2 | 16 | 4.66 |