Title: Partitioning a Planar Point Set into Empty Convex Polygons
Abstract: For a planar n point set P in general position, a convex polygon of P is called empty if no point of P lies in its interior. We show that P can be always partitioned into at most ⌈9n/34 ⌉ empty convex polygons and that ⌈(n + 1)/4 ⌉ empty convex polygons are occasionally necessary.
Publication Year: 2003
Publication Date: 2003-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot