A worst-case efficient algorithm for hidden-line elimination<sup>†</sup> (Q3802610): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter Widmayer / rank
Normal rank
 
Property / author
 
Property / author: Derick Wood / rank
Normal rank
 
Property / author
 
Property / author: Peter Widmayer / rank
 
Normal rank
Property / author
 
Property / author: Derick Wood / 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.1080/00207168508803482 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026948925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on “algorithms for reporting and counting geometric intersections” / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of some rectangle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4776831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane-sweep algorithms for intersecting geometric figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Search Trees of Bounded Balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the Boolean masking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear line segment intersection, layered segment trees, and dynamization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:11, 18 June 2024

scientific article
Language Label Description Also known as
English
A worst-case efficient algorithm for hidden-line elimination<sup>†</sup>
scientific article

    Statements

    A worst-case efficient algorithm for hidden-line elimination<sup>†</sup> (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    computational geometry
    0 references
    worst case analysis
    0 references
    computer graphics
    0 references
    display algorithms
    0 references
    hidden-line-elimination
    0 references

    Identifiers