A construction for visualC1 continuity of polynomial surface patches

Gerald Farin

doi:10.1016/0146-664X(82)90085-5

A construction for visualC¹ continuity of polynomial surface patches

Gerald Farin

Computing, Informatics and Decision Systems Engineering, School of (CIDSE)

Research output: Contribution to journal › Article

78 Scopus citations

Abstract

A geometric construction is described which ensures tangent plane (visualC¹) 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	https://doi.org/10.1016/0146-664X(82)90085-5
State	Published - Nov 1982

ASJC Scopus subject areas

Environmental Science(all)
Earth and Planetary Sciences(all)

Cite this

Farin, G. (1982). A construction for visualC¹ continuity of polynomial surface patches. Computer Graphics and Image Processing, 20(3), 272-282. https://doi.org/10.1016/0146-664X(82)90085-5

@article{2979d3aa984744b4891f92f3295393c6,

title = "A construction for visualC1 continuity of polynomial surface patches",

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.",

author = "Gerald Farin",

year = "1982",

month = nov

doi = "10.1016/0146-664X(82)90085-5",

language = "English (US)",

volume = "20",

pages = "272--282",

journal = "Computer Graphics and Image Processing",

issn = "0146-664X",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - A construction for visualC1 continuity of polynomial surface patches

AU - Farin, Gerald

PY - 1982/11

Y1 - 1982/11

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 -

Access to Document

10.1016/0146-664X(82)90085-5