10 citations · 25 across the 10 of their papers we have counts for
4 papers · 1 filter
On the Complexity of Recognizing Nerves of Convex Sets
Patrick Schnider, Simon Weber
We study the problem of recognizing whether a given abstract simplicial complex is the -skeleton of the nerve of -dimensional convex sets in . We denote thi…
Reducing Nearest Neighbor Training Sets Optimally and Exactly
Josiah Rohrer, Simon Weber
In nearest-neighbor classification, a training set of points in with given classification is used to classify every point in : Every point gets the…
The Complexity of Recognizing Geometric Hypergraphs
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist +2
As set systems, hypergraphs are omnipresent and have various representations ranging from Euler and Venn diagrams to contact representations. In a geometric representation of a hyp…
Topological Art in Simple Galleries
Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow +2
Let be a simple polygon, then the art gallery problem is looking for a minimum set of points (guards) that can see every point in . We say two points can see each…