Persistent data structures for fast point location

Authors:
Michał Wichulski;Jacek Rokicki
Affiliations:
Warsaw University of Technology, Institute of Aeronautics and Applied Mechanics, Warsaw, Poland;Warsaw University of Technology, Institute of Aeronautics and Applied Mechanics, Warsaw, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 3
Cited 0

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Introduction to algorithms

Introduction to algorithms
Efficient point location in a convex spatial cell-complex

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents practical implementation of an algorithm for fast point location an triangular 2D meshes. The algorithm cost is proportional to log2 N while storage is a liear function of the number of mesh vertices N. The algorithm bases on using persistent data structures was used which store only changes between consecutive mesh levels. The performance of the presented approach was positively verified for a sequence of meshes starting from 1239 up to 1846197 cells.