3 papers
math.CO2018
New Lower Bounds for the Number of Pseudoline Arrangements
Adrian Dumitrescu, Ritankar Mandal
Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sort…
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 points in the plane is . 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 of randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independe…