In-place algorithms for computing (Layers of) maxima (Q848632): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126446668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time / 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: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear expected-time algorithms for computing maxima and convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional layers of maxima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient planar convex hull algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient geometric divide-and-conquer algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convex layers of a planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal output-sensitive convex hull algorithms in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing stable in-place merging. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for in-place merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically efficient in-place merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Maintenance of Maxima of 2-d Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / 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: Computing dominances in \(E^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable unmerging in linear time and constant space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-segment intersection made in-place / rank
 
Normal rank

Latest revision as of 13:03, 2 July 2024

scientific article
Language Label Description Also known as
English
In-place algorithms for computing (Layers of) maxima
scientific article

    Statements

    In-place algorithms for computing (Layers of) maxima (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2010
    0 references
    0 references
    In-place algorithms
    0 references
    Pareto-optimal points
    0 references
    Computational geometry
    0 references
    0 references