Skip to main navigation Skip to search Skip to main content

Realization Spaces of Arrangements of Convex Bodies

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce combinatorial types of 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. On one hand, we show that every combinatorial type can be realized by an arrangement of convex bodies and (under mild assumptions) its realization space is contractible. On the other hand, we prove a universality theorem that says that the restriction of the realization space to arrangements of convex polygons with a bounded number of vertices can have the homotopy type of any primary semialgebraic set.

Original languageEnglish
Title of host publication31st International Symposium on Computational Geometry, SoCG 2015
EditorsJanos Pach, Lars Arge
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages599-614
Number of pages16
ISBN (Electronic)9783939897835
DOIs
StatePublished - Jun 1 2015
Event31st International Symposium on Computational Geometry, SoCG 2015 - Eindhoven, Netherlands
Duration: Jun 22 2015Jun 25 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume34

Conference

Conference31st International Symposium on Computational Geometry, SoCG 2015
Country/TerritoryNetherlands
CityEindhoven
Period06/22/1506/25/15

Keywords

  • Convex sets
  • Mnev s universality theorem
  • Oriented matroids
  • Realization spaces

Fingerprint

Dive into the research topics of 'Realization Spaces of Arrangements of Convex Bodies'. Together they form a unique fingerprint.

Cite this