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

DOI10.4230/LIPIcs.SoCG.2017.54zbMath1436.05032OpenAlexW2730749296MaRDI QIDQ4580132

Manuel Wettstein, Alexander Pilz, Ermo Welzl

Publication date: 13 August 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/compgeom/compgeom2017.html#PilzWW17

zbMATH Keywords

polytopewheel setsimplicial depthgeometric graphGale transform

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ Induced Ramsey-type results and binary predicates for point sets ⋮ Arrangements of approaching pseudo-lines

This page was built for publication: From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices