A set operation algorithm for sculptured solids modeled with trimmed patches (Q1122931): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Heinrich Guggenheimer / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Heinrich Guggenheimer / 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/0167-8396(89)90026-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027294899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracing surface intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface/surface intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a divide-and-conquer method for intersection of parametric surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for algebraic curve intersection / rank
 
Normal rank

Latest revision as of 08:55, 20 June 2024

scientific article
Language Label Description Also known as
English
A set operation algorithm for sculptured solids modeled with trimmed patches
scientific article

    Statements

    A set operation algorithm for sculptured solids modeled with trimmed patches (English)
    0 references
    0 references
    0 references
    1989
    0 references
    It has long been standard practice in differential geometry to define a surface by a set of charts, maps of the unit square into three-space. If the surface is defined not by charts based on open sets but on nonoverlapping closed sets then the charts are called trimmed patches in computer graphics. The authors develop an algorithm to compute union, intersection and set difference of surfaces based on trimmed patches. The relatively simple combinatorial structure of the procedure shows that general trimmed patches are a useful tool in CAD.
    0 references
    computer aided design
    0 references
    trimmed patches
    0 references
    computer graphics
    0 references
    algorithm
    0 references
    combinatorial structure
    0 references

    Identifiers