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

메뉴 건너뛰기

Information Processing Letters

Volumn 66, Issue 6, 1998, Pages 277-283

Algorithms for three-dimensional dominance searching in linear space

(2) Makris, Christos a Tsakalidis, Athanasios b

a UNIVERSITY OF PATRAS (Greece)

b University of Patras and Computer Technology Institute (Greece)

Author keywords

Computational geometry; Dominance searching; Persistence

Indexed keywords

EID: 0042262549 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/s0020-0190(98)00075-1 Document Type: Article

Times cited : (31)

References (13)

1
- 0027969691
- Biased finger trees and three-dimensional layers of maxima
- M.J. Atallah, M.T. Goodrich, K. Ramaier, Biased finger trees and three-dimensional layers of maxima, in: Proc. ACM Symposium on Computational Geometry, 1994, pp. 150-159.
- (1994) Proc. ACM Symposium on Computational Geometry , pp. 150-159
- Atallah, M.J.¹ Goodrich, M.T.² Ramaier, K.³

2
- 0042164776
- Two- And three-dimensional point location in rectangular subdivisions
- M. de Berg, M. van Kreveld, J. Snoeyink, Two- and three-dimensional point location in rectangular subdivisions, J. Algorithms 18 (1995) 256-277.
- (1995) J. Algorithms , vol.18 , pp. 256-277
- De Berg, M.¹ Van Kreveld, M.² Snoeyink, J.³

3
- 0022767762
- Filtering search: A new approach to query answering
- B. Chazelle, Filtering search: a new approach to query answering, SIAM J. Comput. 15 (1986) 703-724.
- (1986) SIAM J. Comput. , vol.15 , pp. 703-724
- Chazelle, B.¹

4
- 0043166720
- Linear space data structures for two types of range search
- B. Chazelle, H. Edelsbrunner, Linear space data structures for two types of range search, Discrete Comput. Geom. 3 (1987) 113-126.
- (1987) Discrete Comput. Geom. , vol.3 , pp. 113-126
- Chazelle, B.¹ Edelsbrunner, H.²

5
- 0023010037
- Fractional cascading: I. A data structuring technique, II. Applications
- B. Chazelle, L.J. Guibas, Fractional cascading: I. A data structuring technique, II. Applications, Algorithmica 1 (1986) 133-162, 163-192.
- (1986) Algorithmica , vol.1 , pp. 133-162
- Chazelle, B.¹ Guibas, L.J.²

6
- 0024606010
- Making data structures persistent
- J.R. Driscoll, N. Sarnak, D.D. Sleator, R.E. Tarjan, Making data structures persistent, J. Comput. Systems Sci. 38 (1989) 86-124.
- (1989) J. Comput. Systems Sci. , vol.38 , pp. 86-124
- Driscoll, J.R.¹ Sarnak, N.² Sleator, D.D.³ Tarjan, R.E.⁴

7
- 0005260102
- On the equivalence of some rectangle problems
- H. Edelsbrunner, M.H. Overmars, On the equivalence of some rectangle problems, Inform. Process. Lett. 14 (1982) 124-127.
- (1982) Inform. Process. Lett. , vol.14 , pp. 124-127
- Edelsbrunner, H.¹ Overmars, M.H.²

8
- 0023365551
- A log log n data structure for three-sided range queries
- O. Fries, K. Mehlhorn, S. Näher, A. Tsakalidis, A log log n data structure for three-sided range queries, Inform. Process. Lett. 25 (1987) 269-273.
- (1987) Inform. Process. Lett. , vol.25 , pp. 269-273
- Fries, O.¹ Mehlhorn, K.² Näher, S.³ Tsakalidis, A.⁴

9
- 85020601782
- Scaling and related techniques for geometry problems
- H.N. Gabow, J.L. Bentley, R.E. Tarjan, Scaling and related techniques for geometry problems, in: Proc. 16th Ann. ACM Symp. on Theory of Computing, 1984, pp. 135-143.
- (1984) Proc. 16th Ann. ACM Symp. on Theory of Computing , pp. 135-143
- Gabow, H.N.¹ Bentley, J.L.² Tarjan, R.E.³

10
- 0025702474
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- K. Mehlhorn, S. Näher, Bounded ordered dictionaries in O(log log N) time and O(n) space, Inform. Process. Lett. 35 (1990) 183-189.
- (1990) Inform. Process. Lett. , vol.35 , pp. 183-189
- Mehlhorn, K.¹ Näher, S.²

11
- 0003487647
- Springer, Berlin
- F. Preparata, M. Shamos, Computational Geometry, An Introduction, Springer, Berlin, 1988.
- (1988) Computational Geometry, an Introduction
- Preparata, F.¹ Shamos, M.²

12
- 84976669340
- Planar point location using persistent search trees
- N. Sarnak, R.E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986) 669-679.
- (1986) Comm. ACM , vol.29 , pp. 669-679
- Sarnak, N.¹ Tarjan, R.E.²

13
- 0020802573
- Log-logarithmic worst-case range queries are possible in space Θ(N)
- D.E. Willard, Log-logarithmic worst-case range queries are possible in space Θ(N), Inform. Process. Lett. 17 (1983) 81-84.
- (1983) Inform. Process. Lett. , vol.17 , pp. 81-84
- Willard, D.E.¹

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