Constructing a route connecting a source node to a destination node is one of the central problems in sensor networks and mobile computing. In this paper we consider the application of a data structure called ExtDCEL that can be very effective in implementing several location-based routing algorithms that include face routing, greedy most forward routing, and hybrid routing. The ExtDCEL data structure is very convenient for representing unit disk graphs as well as planar components. Many network properties can be computed locally when the graph is represented in ExtDCEL. In particular, we show how the popular hybrid greedy face routing algorithm can be implemented efficiently by using ExtDCEL.