96 citations · 442 across the 64 of their papers we have counts for
Showing 2013 · cs.CGShow all
3 papers · 2 filters
cs.CG2013★ 1 cited
Counting Triangulations and other Crossing-free Structures via Onion Layers
Victor Alvarez, Karl Bringmann, Radu Curticapean +1
Let be a set of points in the plane. A crossing-free structure on is a plane graph with vertex set . Examples of crossing-free structures include triangulations of $…
cs.CG2013
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
Victor Alvarez, Karl Bringmann, Saurabh Ray
Let be a set of points. In this paper we show two new algorithms, one to compute the number of triangulations of , and one to compute the number of…
cs.CG2013★ 4 cited
Bringing Order to Special Cases of Klee's Measure Problem
Karl Bringmann
Klee's Measure Problem (KMP) asks for the volume of the union of n axis-aligned boxes in d-space. Omitting logarithmic factors, the best algorithm has runtime O*(n^{d/2}) [Overmars…