CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (Q4682156): 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: Parallel computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for some functions of two convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for point-set and polygon problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublogarithmic convex hull algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing strongly convex approximate hulls with inaccurate primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing strongly convex hulls using exact or rounded arithmetic / rank
 
Normal rank

Latest revision as of 12:17, 10 June 2024

scientific article; zbMATH DE number 2174808
Language Label Description Also known as
English
CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
scientific article; zbMATH DE number 2174808

    Statements

    CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2005
    0 references
    0 references
    Convex hull
    0 references
    strongly convex superhull
    0 references
    approximate computing
    0 references
    tolerance in computational geometry
    0 references