1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.CG2021★ 1 cited
Computing the Multicover Bifiltration
René Corbet, Michael Kerber, Michael Lesnick +1
Given a finite set , let Cov denote the set of all points within distance to at least points of . Allowing and to vary, we obtain a…
cs.CG2020★ 1 cited
A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes
Herbert Edelsbrunner, Georg Osang
We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-$…
cs.DM2012
Fork-forests in bi-colored complete bipartite graphs
Maria Axenovich, Marcus Krug, Georg Osang +1
Motivated by the problem in [6], which studies the relative efficiency of propositional proof systems, 2-edge colorings of complete bipartite graphs are investigated. It is shown t…