Saurabh Ray

activity

20092026

most citedOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems

17 citations · 24 across the 7 of their papers we have counts for

collaborators

Showing 2013 · cs.CGShow all

2 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 $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$ . 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 $P \subset R^{2}$ be a set of $n$ points. In this paper we show two new algorithms, one to compute the number of triangulations of $P$ , and one to compute the number of…