3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.CG2018★ 3 cited
A universality theorem for allowable sequences with applications
Udo Hoffmann, Keno Merckx
Order types are a well known abstraction of combinatorial properties of a point set. By Mnëv's universality theorem for each semi-algebraic set there is an order type with a re…
math.CO2015
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
Given a line arrangement with lines, we show that there exists a path of length in the dual graph of formed by its faces. This bound is tight u…