Persistent Data Structures for Fast Point Location
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.
KeywordsPoint Location Binary Search Tree Mesh Vertex Hanging Node Query Cost
Unable to display preview. Download preview PDF.
- 1.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)Google Scholar
- 3.Discroll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 267–280 (1989)Google Scholar
- 4.Benek, J.A., Buning, P.G., Steger, J.L.: A 3-D Chimera Grid Embedding Technique. AIAA Paper 85, 1523 (1985)Google Scholar