Applications of a semi-dynamic convex hull algorithm (Q1196456): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3360902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem in the plane / 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: A faster algorithm for the maximum weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding tailored partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem-solving through problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal real-time algorithm for planar convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank

Revision as of 13:50, 16 May 2024

scientific article
Language Label Description Also known as
English
Applications of a semi-dynamic convex hull algorithm
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references