Hidden-surface removal in polyhedral cross-sections (Q1104083): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the intersection of two convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A worst-case efficient algorithm for hidden-line elimination<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for eliminating hidden-lines from a polygonal cylinder / rank
 
Normal rank

Latest revision as of 17:39, 18 June 2024

scientific article
Language Label Description Also known as
English
Hidden-surface removal in polyhedral cross-sections
scientific article

    Statements

    Hidden-surface removal in polyhedral cross-sections (English)
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    polyhedral cross-sections
    0 references
    computational geometry
    0 references
    decomposition techniques
    0 references
    dynamization techniques
    0 references
    visibility
    0 references
    hidden-surface problem
    0 references
    scene
    0 references
    priority orderings
    0 references