We study the problem of multiple, physically-separated mobile robots meeting at a point. This task, termed as rendezvous, is investigated when the mobile robots have unequal speeds. An algorithm for computing the minimum time rendezvous point (denoted by P) for a pair of robots moving amidst polygonal obstacles is presented. The algorithm is based on the notion of visibility graph and computes P exactly. Comparisons with an alternate approach based on level sets are given. An extension to rendezvous of three robots (in minimum time), based on the notion of Apollonius circles is also presented. We present an experimental setup consisting of multiple mobile robots, fabricated in-house. We also discuss experiments with the robots.