A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring Concavity on a Rectangular Mosaic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for finding the convex hull of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the convex hull of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969899 / rank
 
Normal rank

Latest revision as of 10:03, 14 June 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm for obtaining the convex hull of a simple polygon
scientific article

    Statements

    A linear time algorithm for obtaining the convex hull of a simple polygon (English)
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex hull algorithm
    0 references
    computational complexity
    0 references
    simple polygon
    0 references
    convex polygon
    0 references
    ordered crossing polygon
    0 references
    0 references