SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

International Journal of Computational Geometry and Applications

Volumn 12, Issue 1-2, 2002, Pages 143-172

Fast software for box intersections

(2) Zomorodian, Afra a Edelsbrunner, Herbert b,c

a Digital Computer Laboratory (United States)

b Duke University (United States)

c Raindrop Geomagic (United States)

Author keywords

Algorithms; Box intersection; Experimentation; Implementation; Quantification; Range tree; Segment tree

Indexed keywords

EID: 0036002817 PISSN: 02181959 EISSN: None Source Type: Journal
DOI: 10.1142/s0218195902000785 Document Type: Conference Paper

Times cited : (35)

References (21)

1
- 0019035230
- An optimal worst case algorithm for reporting intersections of rectangles
- (1980) IEEE Trans. Comput. , vol.C-29 , pp. 571-577
- Bentley, J.L.¹ Wood, D.²

2
- 0016557674
- Multidimensional search trees used for associative searching
- (1975) Comm. ACM , vol.18 , pp. 509-517
- Bentley, J.L.¹

3
- 0018999905
- Multidimensional divide and conquer
- (1980) Comm. ACM , vol.23 , pp. 214-229
- Bentley, J.L.¹

4
- 0030493274
- Approximating center points with iterative radon points
- (1996) Internat. J. Comput. Geom. Appl. , vol.6 , pp. 357-377
- Clarkson, K.L.¹ Eppstein, D.² Miller, G.L.³ Sturtivant, C.⁴ Teng, S.-H.⁵

5
- 0004116989
- The MIT Press, Cambridge, MA
- (1994) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³

6
- 0342367433
- Batched dynamic solutions to decomposable searching problems
- (1980) J. Algorithms , vol.6 , pp. 515-542
- Edelsbrunner, H.¹ Overmars, M.H.²

7
- 0003935459
- Addison Wesley, Reading, MA, second edition
- (1996) Computer Graphics: Principles and Practice
- Foley, J.D.¹ Van Dam, A.² Feiner, S.K.³ Hughes, J.F.⁴ Phillips, R.L.⁵

8
- 0030421708
- OBB-tree: A hierarchical structure for rapid interference detection
- (1996) SIGGRAPH 96 Conference Proceedings , pp. 171-180
- Gottschalk, S.¹ Lin, M.² Manocha, D.³

9
- 0021615874
- R-trees: A dynamic index structure for spatial searching
- (1984) SIGMOD Conference Proceedings , pp. 47-57
- Guttmann, A.¹

10
- 0004302191
- Morgan Kaufmann Publishers, Inc., San Francisco, CA, second edition
- (1989) Computer Architecture: A Quantitative Approach
- Hennessy, J.L.¹ Patterson, D.A.²

11
- 0009891224
- Theory and practice, IV
- CSLI Publications, Stanford, CA
- (1996) Selected Papers on Computer Science
- Knuth, D.E.¹

12
- 0001308433
- Spherical shell: A higher order bounding volume for fast proximity queries
- (1998) Proceedings of the Third International Workshop on Algorithmic Foundations of Robotics , pp. 122-136
- Krishnan, S.¹ Pattekar, A.² Lin, M.³ Manocha, D.⁴

13
- 0003896351
- Kluwer Academic Publishers, Norwell, MA
- (1991) Robot Motion Planning
- Latombe, J.C.¹

14
- 0000125638
- Collision detection between geometric models: A survey
- (1998) Proceedings of the IMA Conference on Mathematics of Surfaces
- Lin, M.C.¹ Gottschalk, S.²

15
- 0028742542
- Geometric range searching
- (1994) ACM Comput. Surveys , vol.26 , pp. 21-461
- Matoušek, J.¹

16
- 0025475508
- Merging BSP trees yield polyhedral modeling results
- (1990) SIGGRAPH 90 Conference Proceedings , pp. 115-124
- Naylor, B.¹ Amanatides, J.² Thibault, W.³

17
- 0004022620
- Addison Wesley, Reading, MA
- (1989) Spatial Data Structures: Quadtree, Octrees, and Other Hierarchical Methods
- Samet, H.¹

18
- 0003821547
- Addison Wesley, Reading, MA
- (1997) Algorithms in C: Fundamentals, Data Structures, Sorting, Searching
- Sedgewick, R.¹

19
- 85032346047
- Geometric intersection problems
- (1976) Proc. 17th Ann. IEEE Sympos. Found. Comput. Sci. , pp. 208-215
- Shamos, M.I.¹ Hoey, D.²

20
- 84945709955
- An efficient algorithm for sorting with minimal storage (Algorithm 347)
- (1969) Comm. ACM , vol.12 , pp. 185-187
- Singleton, R.C.¹

21
- 0032761915
- Analysis of a bounding box heuristic for object intersection
- (1999) Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms
- Zhou, Y.¹ Suri, S.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.