Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q170474
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hervé Brönnimann / 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/j.comgeo.2005.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065822517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards in-place geometric algorithms and data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient planar convex hull algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically efficient in-place merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable minimum space partitioning in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting multisets stably in minimum space / 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: On-line construction of the convex hull of a simple polyline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable in situ sorting and minimum data movement / rank
 
Normal rank

Latest revision as of 14:04, 24 June 2024

scientific article
Language Label Description Also known as
English
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
scientific article

    Statements

    Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (English)
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    0 references
    Computational geometry
    0 references
    Convex hull
    0 references
    Space-efficient algorithm
    0 references
    simple polygonal line
    0 references
    0 references