From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
DOI10.1007/s00454-019-00147-1zbMath1450.05016arXiv1812.01595OpenAlexW2985008556MaRDI QIDQ2207612
Manuel Wettstein, Alexander Pilz, Ermo Welzl
Publication date: 23 October 2020
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01595
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Discrete geometry (52C99) Graph representations (geometric and intersection representations, etc.) (05C62)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting triangulations of planar point sets
- Chords, trees and permutations
- Geometric Knapsack problems
- Enumeration of self-dual configurations
- Semispaces of configurations, cell complexes of arrangements
- On a triangle counting problem
- On a notion of data depth based on random simplices
- The number of \(M\)-sequences and \(f\)-vectors
- Finding minimum area \(k\)-gons
- Geometric medians
- Analytic combinatorics of non-crossing configurations
- Counting polytopes via the Radon complex
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- A new lower bound on the maximum number of plane graphs using production matrices
- On the number of plane geometric graphs
- A lower bound for the rectilinear crossing number
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
- Multidimensional Sorting
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Lectures on Polytopes
- Algorithm AS 307: Bivariate Location Depth
- Convex Polytopes
- Crossing-Free Perfect Matchings in Wheel Point Sets
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Motzkin numbers
- Entering and leaving \(j\)-facets
- A continuous analogue of the upper bound theorem
This page was built for publication: From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
