SCOPUS 정보 검색 플랫폼

Volumn 36, Issue 4, 1999, Pages 257-266

An optimal algorithm for decomposing a window into maximal quadtree blocks

a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033153874 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050160 Document Type: Article

Times cited : (18)

References (12)

2
- 21144482784
- Decomposing a window into maximal quadtree blocks
- 2. W.G. Aref, H. Samet: Decomposing a window into maximal quadtree blocks, Acta Informatica, 30(5), 425-439 (1993)
- (1993) Acta Informatica , vol.30 , Issue.5 , pp. 425-439
- Aref, W.G.¹ Samet, H.²

3
- 0020336381
- The space efficiency of quadtrees
- 3. C.R. Dyer: The space efficiency of quadtrees, Comput Graph Image Process, 19(4), 335-348 (1982)
- (1982) Comput Graph Image Process , vol.19 , Issue.4 , pp. 335-348
- Dyer, C.R.¹

4
- 38249015965
- Analytical results on the quadtree decomposition of arbitrary rectangles
- 4. C. Faloutsos: Analytical results on the quadtree decomposition of arbitrary rectangles, Pattern Recognition Letters, 13(1), 31-40 (1992)
- (1992) Pattern Recognition Letters , vol.13 , Issue.1 , pp. 31-40
- Faloutsos, C.¹

5
- 0031144050
- Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles
- 5. C. Faloutsos, H.V. Jagadish, Y. Manolopoulos: Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles, IEEE Trans Knowl Data Eng, 9(3), 373-383 (1997)
- (1997) IEEE Trans Knowl Data Eng , vol.9 , Issue.3 , pp. 373-383
- Faloutsos, C.¹ Jagadish, H.V.² Manolopoulos, Y.³

6
- 0020249952
- An effective way to represent quadtrees
- 6. I. Gargantini: An effective way to represent quadtrees, Communications of the ACM, 25(12), 905-910 (1982)
- (1982) Communications of the ACM , vol.25 , Issue.12 , pp. 905-910
- Gargantini, I.¹

7
- 0031384380
- MOF-tree: A spatial access method to manipulate multiple overlapping features
- 7. Y. Manolopoulos, E. Nardelli, A. Papadopoulos, G. Proietti: MOF-tree: a Spatial Access Method to Manipulate Multiple Overlapping Features, Inf Syst, 22 8, 465-481 (1997)
- (1997) Inf Syst , vol.22 , Issue.8 , pp. 465-481
- Manolopoulos, Y.¹ Nardelli, E.² Papadopoulos, A.³ Proietti, G.⁴

8
- 0008993389
- An optimal resolution sensitive pyramid representation for hierarchical memory models
- 8. E. Nardelli, G. Proietti: An optimal resolution sensitive pyramid representation for hierarchical memory models, J Comput Inf, 1, 385-402 (1994)
- (1994) J Comput Inf , vol.1 , pp. 385-402
- Nardelli, E.¹ Proietti, G.²

9
- 0031097321
- Time and space efficient secondary memory representation of quadtrees
- 9. E. Nardelli, G. Proietti: Time and space efficient secondary memory representation of quadtrees, Inf Syst, 22(1), 25-37 (1997)
- (1997) Inf Syst , vol.22 , Issue.1 , pp. 25-37
- Nardelli, E.¹ Proietti, G.²

10
- 85040889046
- Reading, MA: Addison-Wesley
- 10. H. Samet: The design and analysis of spatial data structures, Reading, MA: Addison-Wesley 1989
- (1989) The Design and Analysis of Spatial Data Structures
- Samet, H.¹

11
- 0021644214
- The quadtree and related hierarchical data structures
- 11. H. Samet: The quadtree and related hierarchical data structures, Comput Surveys 16(2), 187-260 (1984)
- (1984) Comput Surveys , vol.16 , Issue.2 , pp. 187-260
- Samet, H.¹

12
- 0000357960
- A hierarchical data structure for picture processing
- 12. S. Tanimoto, T. Pavlidis: A hierarchical data structure for picture processing, Comput Graph Image Process, 4(2), 104-119 (1975)
- (1975) Comput Graph Image Process , vol.4 , Issue.2 , pp. 104-119
- Tanimoto, S.¹ Pavlidis, T.²

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