17 citations · 24 across the 7 of their papers we have counts for
4 papers · 1 filter
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 $…
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…
On Totally Positive Matrices and Geometric Incidences
Miriam Farber, Saurabh Ray, Shakhar Smorodinsky
A matrix is called totally positive if every minor of it is positive. Such matrices are well studied and have numerous applications in Mathematics and Computer Science. We study ho…
Point Line Cover: The Easy Kernel is Essentially Tight
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
The input to the NP-hard Point Line Cover problem (PLC) consists of a set of points on the plane and a positive integer , and the question is whether there exists a set…