Haritha Bellam

Learn More
A set of n colored objects (points/hyperboxes) lie in IR d and given a query orthogonal range q, we need to report the distinct colors of the objects in S ∩ q. In a scenarto where these colored objects also come associated with a weight, for each distinct color c of the objects in S ∩ q, the tuple < c, F(c) > where F(c) is the object of color c with the(More)
Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Specically, given n red points and n blue points in the plane, we want to construct a perfect matching between red and blue points that minimizes the length of the longest edge, while imposing a constraint that no two edges may cross(More)
  • 1