HIRATA, Tomio

INAGAKI, Yasuyoshi

TAN, Xuehou

Persistent data structures, introduced by Sarnak and Tarjan, have been found especially useful in designing geometric algorithms. In this paper, we present a persistent form of binary-binary search tree, and then apply this data structure to solve various geometric searching problems, such as, three dimensional ray-shooting, hidden surface removal, polygonal point enclosure searching and so on. In all applications, we are able to either improve existing bounds or establish new bounds

Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees

Abstract

Similar works

Full text

Available Versions

Institutional Repositories DataBase (IRDB)