Title
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
Abstract
For a planar point set P in general position, an empty convex k -gon or a k -hole of P is a convex k -gon H such that the vertices of H are elements of P and no element of P lies inside H . Let n (k 1 ,k 2 , *** ,k l ) be the smallest integer such that any set of n (k 1 , *** ,k l ) points contains a k i -hole for each i , 1 ≤ i ≤ l , where the holes are pairwise disjoint. We evaluate such values. In particular, we show that n (1,2,3,4,5) = 15.
Year
DOI
Venue
2007
10.1007/978-3-540-89550-3_10
KyotoCGGT
Keywords
Field
DocType
planar point,specified disjoint empty convex,minimal planar point set,convex k,k i,general position,k l,pairwise disjoint,empty convex k
Integer,Discrete mathematics,Combinatorics,General position,Disjoint sets,Vertex (geometry),Regular polygon,Planar,Interior point method,Mathematics,Convex cone
Conference
Volume
ISSN
Citations 
4535
0302-9743
4
PageRank 
References 
Authors
0.47
9
2
Name
Order
Citations
PageRank
Kiyoshi Hosono16011.01
Masatsugu Urabe215325.87