Skip to main content
Article thumbnail
Location of Repository

Planar Point Sets with Large Minimum Convex Partitions

By et al. Jesus Garcia-Lopez

Abstract

Given a finite set S of points in the plane, a convex partition of S is a subdivision of the convex hull of S into nonoverlapping empty convex polygons with vertices in S. Let G(S) be the minimum m such that there exists a convex partition of S with at most m faces. Let F(n) be the maximum value of G(S) among all the sets of n points in the plane. It is known [1] that F(n) ≥ n + 2 for n ≥ 13. In this paper we show that, for n ≥ 4 F(n)> 12 n − 2. Als

Topics: h
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.8945
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://eurocg.org/06/delaunay.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.