Improved test for closed loops in surface intersections (Q1263921): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Thomas W. Sederberg / rank
 
Normal rank
Property / author
 
Property / author: Sheldon Katz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0010-4485(89)90058-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079757056 / rank
 
Normal rank

Latest revision as of 21:20, 19 March 2024

scientific article
Language Label Description Also known as
English
Improved test for closed loops in surface intersections
scientific article

    Statements

    Improved test for closed loops in surface intersections (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    The following theorem along with its curve version is proved: If two nonsingular surface patches intersect in a closed loop, if the dot product between any normal vector on one surface and any other normal vector on either surface is never zero, and if the normal vector is uniquely defined at every point on each surface region, then there is a line which is perpendicular to both surface patches simultaneously. The theorem is intended to serve as a tool for ensuring that the intersection curve of two surfaces does not contain a closed loop (that is, a closed curve that does not intersect any patch boundary curve) or providing a technique for subdividing one of the patches so that there is no loop within them. Some algorithmic considerations are sketched, too.
    0 references
    surface intersections
    0 references
    computer-aided design
    0 references
    subdivision
    0 references
    intersection curve
    0 references
    closed loop
    0 references

    Identifiers