A data structure for gridless routing

Abstract

A new data structure suitable for the implementation of gridless routing algorithms is presented. The data structure and some basic access procedures are outlined in PASCAL and experimental results are given to demonstrate the performance of retrieval algorithms working on the structure.