Geometric routing is a routing scheme proposed for networks with highly dynamic topology, like wireless ad hoc networks. It uses the geometric coordinates of the nodes and makes routing decisions based on the geometric properties between them. Hence, it does not build and maintain routing tables. Nevertheless, as geometric routing requires an auxiliary location service to equip nodes with geometric location, there are not much deployments in real network settings. In this chapter, we investigate an efficient localization system called Virtual Raw Anchor Coordinates (VRACs), which is an anchor-based coordinate system. It assigns the raw distances from anchors as the coordinates of nodes, hence avoiding further computations. Despite its efficiency, it is not possible to perform geometric operations on VRAC. In this manuscript, we propose alternative constructs to perform geometric routing over VRAC. Initially, a greedy routing algorithm is developed, which is then combined with a face routing strategy, when greedy routing does not guarantee delivery. Moreover, we present the conditions over which greedy routing can be performed on VRAC. In Sect. 5, a geometric routing algorithm is presented, where greedy and face routing are combined to guarantee the delivery of messages. In Sect. 6, a greedy routing algorithm is presented and proved to be successful given that certain connectivity conditions are satisfied.