Skip to main content
SpringerLink
Log in

Persistent Data Structures for Fast Point Location

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4967))

  • 1149 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    Google Scholar 

  2. Preparata, F.P., Tamassia, R.: Efficient point location in a convex spatial cell-complex. SIAM J. Comput. 21(2), 267–280 (1992)

    Article  MATH  MathSciNet  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 

  5. Rokicki, J., Floryan, J.M.: Unstructured Domain Decomposition Method for the Navier-Stokes Equations. Computers & Fluids 28, 87–120 (1999)

    Article  MATH  Google Scholar 

  6. Drikakis, D., Majewski, J., Rokicki, J., Żółtak, J.: Investigation of Blending-Function-Based Overlapping-Grid Technique for Compressible Flows. Computer Methods in Applied Mechanics and Engineering 190(39), 5173–5195 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University of Technology, Institute of Aeronautics and Applied Mechanics, Nowowiejska 24, 00-665, Warsaw, Poland

    Michał Wichulski & Jacek Rokicki

Authors
  1. Michał Wichulski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacek Rokicki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roman Wyrzykowski Jack Dongarra Konrad Karczewski Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wichulski, M., Rokicki, J. (2008). Persistent Data Structures for Fast Point Location. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_141

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68111-3_141

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68105-2

  • Online ISBN: 978-3-540-68111-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation