Sink mobility is a significant technique to improve the performance of wireless sensor networks (WSNs). Generally a mobile sink visits several rendezvous points (RPs), forming a trip tour for data collection. However, the low movement speeds of mobile sinks tend to incur serious data delivery delays. In this article, we propose a quick convex hull-based rendezvous planning (QCHBRP) scheme, which aims to not only achieve full connectivity for disjoint WSNs but also construct a shorter trip tour and minimize the data delivery latency accordingly. The trajectory formation of the mobile sink is based on a path skeleton, i.e., a near-convex hull, which is created by the quick determination of several special locations as RPs. The benefits of QCHBRP are threefold. First, it is especially designed for disjoint WSNs where sensor nodes are deployed in multiple isolated segments and the network connectivity is lost in advance. Second, it is suitable for delay-harsh applications which require short paths of the mobile sink. Third, it is of much lower computational complexity compared with existing methods. The extensive analysis and experiments validate the effectiveness and advantages of this new scheme in terms of connectivity cost and data delivery delay.