On a partition into convex polygons (Q1917247): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Masatsugu Urabe / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Erhard Heil / rank
Normal rank
 
Property / author
 
Property / author: Masatsugu Urabe / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Erhard Heil / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Konvexe Fünfecke in ebenen Punktmengen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with No Empty Convex 7-Gons / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(94)00120-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007033927 / rank
 
Normal rank

Latest revision as of 09:30, 30 July 2024

scientific article
Language Label Description Also known as
English
On a partition into convex polygons
scientific article

    Statements

    On a partition into convex polygons (English)
    0 references
    7 July 1996
    0 references
    A set \(P\) of \(n\) points in the Euclidean plane may be partitioned into subsets such that the convex hulls of all subsets are disjoint. The minimum number of such subsets is called \(f(P)\), and \(F(n)\) is defined to be the maximum of \(f(P)\) over \(P\). Upper and lower estimates are established for \(F(n)\) and similarly defined numbers.
    0 references
    0 references
    0 references
    0 references
    0 references
    partitions
    0 references
    polygon
    0 references
    0 references
    0 references
    0 references