From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices

12/04/2018
by   Alexander Pilz, et al.
0

A set P = H ∪{w} of n+1 points in general position in the plane is called a wheel set if all points but w are extreme. We show that for the purpose of counting crossing-free geometric graphs on P, it suffices to know the so-called frequency vector of P. While there are roughly 2^n distinct order types that correspond to wheel sets, the number of frequency vectors is only about 2^n/2. We give simple formulas in terms of the frequency vector for the number of crossing-free spanning cycles, matchings, w-embracing triangles, and many more. Based on these formulas, the corresponding numbers of graphs can be computed efficiently. Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point w in a set H, i.e., the number of simplices spanned by H that contain w. While the concept of frequency vectors does not generalize easily, we show how to apply similar methods in higher dimensions. The result is an O(n^d-1) time algorithm for computing the simplicial depth of a point w in a set H of n d-dimensional points, improving on the previously best bound of O(n^d n). Configurations equivalent to wheel sets have already been used by Perles for counting the faces of high-dimensional polytopes with few vertices via the Gale dual. Based on that we can compute the number of facets of the convex hull of n=d+k points in general position in R^d in time O(n^{ω,k-2}) where ω≈ 2.373, even though the asymptotic number of facets may be as large as n^k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2020

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization

Given n points in the plane, we propose algorithms to compile connected ...
research
04/24/2023

On polynomials associated to Voronoi diagrams of point sets and crossing numbers

Three polynomials are defined for given sets S of n points in general po...
research
12/07/2018

Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets

Let R and B be a set of red points and a set of blue points in the plane...
research
09/22/2021

On Crossing-Families in Planar Point Sets

A k-crossing family in a point set S in general position is a set of k s...
research
03/01/2020

New production matrices for geometric graphs

We use production matrices to count several classes of geometric graphs....
research
03/15/2021

Tukey Depth Histograms

The Tukey depth of a flat with respect to a point set is a concept that ...
research
02/26/2019

A new lower bound on the maximum number of plane graphs using production matrices

We use the concept of production matrices to show that there exist sets ...

Please sign up or login with your details

Forgot password? Click here to reset