<i>Greedy Routing</i> is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide theoreticalâ€¦ (More)

We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R defined coordinate-wise by polynomials of degrees bounded by some constant d, is bounded by 2 log ,â€¦ (More)

We present three distinct improvements to the neck and limb-based approach to partitioning of visual form [ 11, where pairs of negative curvature minima with good continuation of their respectiveâ€¦ (More)

We consider four problems connected by the common thread of geometry. The first three arise in applications that apriori do not involve geometry but this turns out to be the right language forâ€¦ (More)