Minimum perimeter-sum partitions in the plane (Q2291459): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q802872
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mark T. de Berg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950002077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Perimeter-Sum Partitions in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering points with convex sets of minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: More planar two-center algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL LINE BIPARTITIONS OF POINT SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of diameters efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric complexity of some location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon queries for convex hulls of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear algorithm for the planar 2-center problem / rank
 
Normal rank

Latest revision as of 14:39, 21 July 2024

scientific article
Language Label Description Also known as
English
Minimum perimeter-sum partitions in the plane
scientific article

    Statements

    Minimum perimeter-sum partitions in the plane (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 January 2020
    0 references
    computational geometry
    0 references
    clustering
    0 references
    minimum-perimeter partition
    0 references
    convex hull
    0 references

    Identifiers