15 citations · 38 across the 11 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2014
Counting Triangulations and other Crossing-Free Structures Approximately
Victor Alvarez, Karl Bringmann, Saurabh Ray +1
We consider the problem of counting straight-edge triangulations of a given set of points in the plane. Until very recently it was not known whether the exact number of tri…
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…