Finding sets covering a point with application to mesh-free galerkin methods

SIAM Journal on Computing

Volumn 30, Issue 4, 2000, Pages 1368-1383

  Han, Xiaoxu ^a   Oliveira, Suely ^b   Stewart, David ^a  

^a UNIVERSITY OF IOWA   (United States)

^b University of Iowa   (United States)

Author keywords

Computational geometry; Quadtree and octree search methods

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GALERKIN METHODS; NUMERICAL METHODS; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING; TREES (MATHEMATICS);

OCTREE SEARCH METHODS; QUADTREE SEARCH METHODS;

SET THEORY;

EID: 0034843056     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799359361     Document Type: Article

References (17)

1. D. J. ABEL AND J. L. SMITH, A data structure and algorithm based on a linear key for a rectangle retrieval problem, Computer Vision, Graphics and Image Processing, 24 (1983), pp. 1-13.
2. A. ANDERSSON AND S. NILSSON, Faster searching in tries and quadtrees - an analysis of level compression, in Lecture Notes in Comput. Sci. 855, Jan van Leemven, ed., Algorithms - ESA '94 (Utrecht), Springer, Berlin, 1994, pp. 82-93.
3. A. ANDERSSON AND K. SWANSON, On the difficulty of range searching, Comput. Geom., 8 (1997), pp. 115-122.
4. T. BELYTSCHKO, Y. KRONGAUZ, D. ORGAN, M. FLEMING, AND P. KRYSL, Meshless methods: An overview and recent developments, Comput. Methods Appl. Mech. Engrg., 139 (1996), pp. 3-47.
5. M. DE BERG, M. VAN KREVELD, M. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry, Algorithms and Applications, Springer-Verlag, Berlin, 1997.
6. P. GAO AND T. R. SMITH, Space efficient hierarchical structures: Relatively addressed compact quadtrees for GISs, Image and Vision Computing, 7 (1989), pp. 173-177.
7. I. GARGANTINI AND H. H. ATKINSON, Linear quadtrees: A blocking technique for contour filling, Pattern Recognition, 17 (1984), pp. 285-293.
8. D. HEARN AND M. P. BAKER, Computer Graphics, 2nd ed., C Version, Prentice-Hall, Englewood Cliffs, NJ, 1994.
9. M. J. LASZLO, Computational geometry and computer graphics in C++, Prentice-Hall, Upper Saddle River, NJ, 1996.
10. S. LI AND W. K. LIU, Reproducing kernel hierarchical partition of unity: Part I: Formulation and theory, Internat. J. Numer. Methods Engrg., 45 (1999), pp. 251-288.
11. M. H. OVERMARS, Point location in fat subdivisions, Inform. Process. Lett., 44 (1992), pp. 261-265.
12. F. P. PREPARATA AND R. TAMASSIA, Fully dynamic point location in a monotone subdivision, SIAM J. Comput., 18 (1989), pp. 811-830.
13. H. SAMET, The quadtree and related hierarchical data structures, Comput. Surveys, 16 (1984), pp. 187-260.
14. H. SAMET, Applications of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
15. H. SAMET, The Design and Analysis of Spatial Data Structures, Series in Computer Science, Addison-Wesley, Reading, MA, 1990.
16. C. A. SHAFFER, H. SAMET, AND R. C. NELSON, A geographic information system based on quadtrees, International Journal of Geographic Information Systems, 4 (1990), pp. 103-131.
17. K. YAMAGUCHI, T. L. KUNII, K. FUJIMURA, AND H. TORIYA, Octree-related data structures and algorithms, IEEE Computer Graphics and Applications, 4 (1984), pp. 53-59.