Abstract
A geometric construction is described which ensures tangent plane (visualC1) continuity between adjacent polynomial surface patches. The algorithm works for both three- and four-sided patches.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 272-282 |
| Number of pages | 11 |
| Journal | Computer Graphics and Image Processing |
| Volume | 20 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1982 |
| Externally published | Yes |
ASJC Scopus subject areas
- Earth and Planetary Sciences(all)
- Environmental Science(all)
Cite this
A construction for visualC1 continuity of polynomial surface patches. / Farin, Gerald.
In: Computer Graphics and Image Processing, Vol. 20, No. 3, 1982, p. 272-282.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A construction for visualC1 continuity of polynomial surface patches
AU - Farin, Gerald
PY - 1982
Y1 - 1982
N2 - A geometric construction is described which ensures tangent plane (visualC1) continuity between adjacent polynomial surface patches. The algorithm works for both three- and four-sided patches.
AB - A geometric construction is described which ensures tangent plane (visualC1) continuity between adjacent polynomial surface patches. The algorithm works for both three- and four-sided patches.
UR - http://www.scopus.com/inward/record.url?scp=0020685972&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0020685972&partnerID=8YFLogxK
U2 - 10.1016/0146-664X(82)90085-5
DO - 10.1016/0146-664X(82)90085-5
M3 - Article
AN - SCOPUS:0020685972
VL - 20
SP - 272
EP - 282
JO - Computer Graphics and Image Processing
JF - Computer Graphics and Image Processing
SN - 0146-664X
IS - 3
ER -