Ritankar Mandal

activity

20122018

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2016

Monotone Paths in Geometric Triangulations

Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth

(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of $n$ points in the plane is $O (1.786 4^{n})$ . This improves an earlier upper bound of $O(1.8393…

cs.CG2012

Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles

Ritankar Mandal, Anirban Ghosh, Sasanka Roy +1

Given a set $R = {R_{1}, R_{2}, ..., R_{n}}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independe…