메뉴 건너뛰기




Volumn , Issue , 1988, Pages 23-33

Partition trees for triangle counting and other range searching problems

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY;

EID: 0006621862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73397     Document Type: Conference Paper
Times cited : (79)

References (14)
  • 1
    • 85014522934 scopus 로고
    • Partitioning and geometric embedding of range spaces of finite vapnik-chervonenkis dimension
    • in preparation (a preliminary version appeared in (1987)
    • Mon N., Haussier D., Welzl E., and Wöginger G., Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension, in preparation, 1987 (a preliminary version appeared in "Proceedings of the 3rd ACM Symposium on Computational Geometry" (1987) 331-340).
    • (1987) Proceedings of the 3rd ACM Symposium on Computational Geometry , pp. 331-340
    • Mon, N.1    Haussier, D.2    Welzl, E.3    Wöginger, G.4
  • 4
    • 0000421687 scopus 로고
    • Central limit theorems for empirical measures
    • Dudley R.M., Central limit theorems for empirical measures, The Annals of Probability 6 (1978) 899-929.
    • (1978) The Annals of Probability , vol.6 , pp. 899-929
    • Dudley, R.M.1
  • 5
    • 0011275803 scopus 로고
    • Balls in R do not cut all subsets of k+2 points
    • Dudley R.M., Balls in R do not cut all subsets of k+2 points, Adv in Math 31 (1979) 306-308.
    • (1979) Adv in Math , vol.31 , pp. 306-308
    • Dudley, R.M.1
  • 7
    • 46149134028 scopus 로고
    • Halfplanar ranga search in linear space and O(n) query time
    • Edelsbrunner H. and Welzl E., Halfplanar ranga search in linear space and O(n) query time, Inform Process Lett 23 (1986) 289-293.
    • (1986) Inform Process Lett , vol.23 , pp. 289-293
    • Edelsbrunner, H.1    Welzl, E.2
  • 8
    • 15744365331 scopus 로고
    • ϵ-nets and simplex range queries
    • Haussler D. and Welzl E., ϵ-nets and simplex range queries, Discrete Comput Geom 2 (1987) 127-151.
    • (1987) Discrete Comput Geom , vol.2 , pp. 127-151
    • Haussler, D.1    Welzl, E.2
  • 9
    • 0040411125 scopus 로고
    • Data structures and algorithms 3: Multi - Dimensional searching and computational geometry
    • Springer - Verlag Berlin Heidelberg
    • Mehlhorn K., Data Structures and Algorithms 3: Multi - dimensional Searching and Computational Geometry, EATCS Monographs in Theoretical Computer Science, Vol. 3, Springer - Verlag Berlin Heidelberg 1984.
    • (1984) EATCS Monographs in Theoretical Computer Science , vol.3
    • Mehlhorn, K.1
  • 11
    • 0001703864 scopus 로고
    • On the density of families of sets
    • Sauer N., On the density of families of sets, J Combin Theory Ser A 13 (1972) 145-147.
    • (1972) J Combin Theory Ser A , vol.13 , pp. 145-147
    • Sauer, N.1
  • 12
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies of events to their probabilities
    • Vapnik V.N. and Chervonenkis A.Ya., On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab Appl 16 (1971) 264-280.
    • (1971) Theory Probab Appl , vol.16 , pp. 264-280
    • Vapnik, V.N.1    Chervonenkis, A.Ya.2
  • 14
    • 0000949343 scopus 로고
    • Polygon retrieval
    • Willard D., Polygon retrieval, SIAM J Comput 11 (1982) 149-165.
    • (1982) SIAM J Comput , vol.11 , pp. 149-165
    • Willard, D.1


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