@article{oai:nagoya.repo.nii.ac.jp:00013166, author = {TAN, Xuehou and HIRATA, Tomio and INAGAKI, Yasuyoshi}, issue = {4}, journal = {IEICE transactions on fundamentals of electronics, communications and computer sciences}, month = {Apr}, note = {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.}, pages = {601--607}, title = {Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees}, volume = {E77-A}, year = {1994} }