# Realization Spaces of Arrangements of Convex Bodies

@article{Dobbins2017RealizationSO, title={Realization Spaces of Arrangements of Convex Bodies}, author={Michael Gene Dobbins and Andreas F. Holmsen and Alfredo Hubard}, journal={Discrete \& Computational Geometry}, year={2017}, volume={58}, pages={1-29} }

We introduce combinatorial types of planar arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial complexity of the bodies and the topological complexity of their realization space. First, we show that every combinatorial type is realizable and its realization space is contractible under mild assumptions. Second, we prove a universality theorem that…

## 3 Citations

### Limits of Order Types

- MathematicsSoCG
- 2015

A rigidity theorem is shown that if sampling two measures induce the same probability distribution on order types, then these measures are projectively equivalent provided the support of at least one of them has non-empty interior.

### Grassmannians and pseudosphere arrangements

- MathematicsJournal de l’École polytechnique — Mathématiques
- 2021

We extend vector configurations to more general objects that have nicer combinatorial and topological properties, called weighted pseudosphere arrangements. These are defined as a weighted variant of…

### Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons

- MathematicsArXiv
- 2018

It is shown that recognizing visibility graphs of polygons with holes is Existential Theory of the Reals Complete, which is the complexity class of problems that can be reduced to the problem of deciding whether there exists a solution to a quantifier-free formula F(X1,X2,...,Xn).

## References

SHOWING 1-10 OF 41 REFERENCES

### Order Types of Convex Bodies

- MathematicsOrder
- 2011

A Hadwiger transversal-type result is proved, characterizing convex position on a family of non-crossing convex bodies in the plane, and a definition for the order type is suggested, generalizing the usual definition of order type for point sets.

### Arrangements of double pseudolines: extended abstract

- MathematicsSCG '09
- 2009

It is shown that any arrangement of double pseudolines is isomorphic to the dual family of a finite family of pairwise disjoint convex bodies of a projective plane endowed with a topological point-line incidence geometry.

### Regular systems of paths and families of convex sets in convex position

- Mathematics
- 2013

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is…

### New Examples of Oriented Matroids with Disconnected Realization Spaces

- MathematicsDiscret. Comput. Geom.
- 2013

We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller point-sets than the known examples with this property. Moreover, we…

### Arrangements of double pseudolines

- MathematicsArXiv
- 2011

It is shown that any arrangement of double pseudolines is isomorphic to the dual family of a finite family of pairwise disjoint convex bodies of a topological point-line incidence geometry on the real projective plane.

### Delaunay triangulations with disconnected realization spaces

- MathematicsSoCG
- 2014

In general, it is proved that the realization space of a Delaunay triangulation in Rd can have Ω(2d) connected components and also shows that the realizability problem for Delauny triangulations is polynomially equivalent to the existential theory of the reals.

### Interval sequences and the combinatorial encoding of planar families of pairwise disjoint convex sets

- Mathematics
- 2005

We extend a combinatorial encoding of families of pairwise d isjoint convex sets in the plane recently introduced by J. E. Goodman and R. Pollack to the case of families not in general position. This…

### Upper bounds for configurations and polytopes inRd

- MathematicsDiscret. Comput. Geom.
- 1986

It follows as a corollary of the first result that there are no more thannd(d+1)n combinatorially distinct labeled simplicial polytopes inRd withn vertices, which improves the best previous upper bound ofncnd/2.

### On the Combinatorial Classification of Nondegenerate Configurations in the Plane

- MathematicsJ. Comb. Theory, Ser. A
- 1980