Abstract
In this paper we present three different results dealing with the number of -facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound of -edges for a fixed ; 2. We give a simple construction showing that the lower bound for the number of -edges of a planar point set appeared in [Aichholzer et al. New lower bounds for the number of ()-edges and the rectilinear crossing number of . {\em Disc. Comput. Geom.} 38:1 (2007), 1--14] is optimal in the range ; 3. We show that for the number of -facets of a set of points in general position in is at least , and that this bound is tight in the given range of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.