On the Reflexivity of Point Sets

  title={On the Reflexivity of Point Sets},
  author={Esther M. Arkin and S{\'a}ndor P. Fekete and Ferran Hurtado and Joseph B. M. Mitchell and Marc Noy and Vera Sacrist{\'a}n Adinolfi and Saurabh Sethia},
We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity ρ(S) of S is given by the smallest number of reflex vertices in a simple polygonalization of S. We prove various combinatorial bounds and provide efficient algorithms to compute reflexivity, both exactly (in special cases) and approximately (in general). Our study naturally takes us into the examination of some closely related quantities, such as the convex… 

Improved Upper Bounds on the Reflexivity of Point Sets

On Polygons Excluding Point Sets

There is a minimal number K = K(l), which is bounded from above by a polynomial in l, such that one can always find a blue polygonization excluding all red points, whenever k ≥ K.

Combinatorial Aspects of [Colored] Point Sets in the Plane

This work studies variations of the classical Erdős-Szekeres problems on convex k-gons and k-holes, and investigates the existence of compatible pointed pseudo-triangulations whose union is a maximal plane graph.

A bound on a convexity measure for point sets

The main result presented here is a nontrivial combinatorial upper bound of this min-max value in terms of the number of points in the set, and a natural conjecture for the best upper bound is posed.

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

The problem of finding a maximumcardinality convex subset of an arbitrary given set P of n points in the plane is examined, the Bottleneck Convex Subsets problem, to give an algorithm that solves the problem exactly, with running time polynomial in n when k is fixed.

Maximizing maximal angles for plane straight-line graphs

Let G=(S,E) be a plane straight-line graph on a finite point set S@?R^2 in general position. The incident angles of a point p@?S in G are the angles between any two edges of G that appear

Holes in 2-Convex Point Sets

Let S be a set of n points in the plane in general position (no three points from S are collinear), and a point set S is l-convex if there exists an l- Convex polygonization of S.

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

It is shown that there always is an optimal fractional solution that contains an edge of at least constant weight and it is conjecture that the resulting iterated rounding scheme constitutes a constant-factor approximation algorithm.

Combinatorics and complexity in geometric visibility problems

It is established that finding a minimum cardinality guard set for covering a polyomino is NP-hard, and an algorithm for constructing a spiral serpentine polygonization of a set of n ≥ 3 points in the plane is introduced.



On the convex layers of a planar set

  • B. Chazelle
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 1985
An optimal algorithm is described for computing the convex layers of S, a set of n points in the Euclidean plane, for which optimal solutions are therefore known.

Fast Triangulation of the Plane with Respect to Simple Polygons

on a Partition into Convex Polygons

On Convex Decompositions of Points

This paper shows that the minimum number of cells in a partition of a planar point set into convex cells, S, such that the union of the cells forms a simple polygon, P, and every point from S is on the boundary of P.

Partitioning point sets in space into disjoint convex polytopes

Searching for empty convex polygons

It is shown that finding empty triangles is related to the problem of determining pairs of vertices that see each other in a star-shaped polygon, and a linear time algorithm for this problem which is of independent interest yields an optimal algorithm for finding all empty triangles.

Angle-Restricted Tours in the Plane

Enumerating Order Types for Small Point Sets with Applications

A complete and reliable data base for all possible order types of size n=10 or less is established and substantiate the usefulness of the data base by applying it to several problems in computational and combinatorial geometry.

Enumerating order types for small sets with applications

A complete and reliable data base for all possible order types of size $n=10$ or less is established and it is believed to be of value to many researchers who wish to examine their conjectures on small point configurations.