DESIGN METHODOLOGY OF BOUNDARY DATA STRUCTURES
SESHAGIRI RAO ALA · International Journal of Computational Geometry & Applications · 1991
In this paper we propose a universal data structure (UDS), termed as UDS, which will aid in the design of optimal boundary data structures. We later show, with the aid of some recently published data structures, that any data structure can be expressed as a special case of UDS. We demonstrate how the application of the optimality concepts of the UDS can lead us to the discovery of more efficient data structures than popular data structures. We also discuss two approaches for optimization. We show that a globally optimal data structure is better than a special purpose optimal data structure.