SCOPUS 정보 검색 플랫폼

Discrete & Computational Geometry

Volumn 11, Issue 1, 1994, Pages 393-418

On range searching with semialgebraic sets

(2) Agarwal, P K a Matousek, J b,c

a DUKE UNIVERSITY (United States)

b CHARLES UNIVERSITY (Czech Republic)

c FREIE UNIVERSITÄT BERLIN (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51249167141 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02574015 Document Type: Article

Times cited : (136)

References (35)

1
- 0038162963
- Ray shooting and other applications of spanning trees with low stabbing number
- (1992) SIAM Journal on Computing , vol.21 , pp. 540-570
- Agarwal, P.K.¹

2
- 84936647998
- P. K. Agarwal, L. Guibas, M. Pellegrini, and M. Sharir. Ray shooting among spheres. Manuscript, 1993.

3
- 38248999733
- Intersection queries for curved objects
- (1993) J. Algorithms , vol.15 , pp. 229-266
- Agarwal, P.K.¹ van Kreveld, M.² Overmars, M.³

4
- 0027641024
- Ray shooting and parametric search
- (1993) SIAM J. Comput. , vol.22 , pp. 794-806
- Agarwal, P.K.¹ Matoušek, J.²

5
- 0040767034
- Applications of a new space partitioning scheme
- (1993) Discrete Comput. Geom. , vol.9 , pp. 11-38
- Agarwal, P.K.¹ Sharir, M.²

6
- 84936647997
- A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrieval problems by compacting Voronoi diagrams. Proc. 21st ACM Symposium on Theory of Computing, 1990, pp. 331–340. Also to appear in J. Assoc. Comput. Mach.

7
- 84936648004
- N. Alon, D. Haussler, E. Welzl, and G. Wöginger. Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension. Proc. 3rd ACM Symposium on Computational Geometry, 1987, pp. 331–340.

8
- 21144464172
- On the zone of a surface in a hyperplane arrangement
- (1993) Discrete Comput. Geom. , vol.9 , pp. 177-186
- Aronov, B.¹ Pellegrini, M.² Sharir, M.³

9
- 84936648003
- M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal. Proc. 7th Symposium on Computational Geometry, 1991, pp. 51–60.

10
- 84968509410
- Lower bounds on the complexity of polytope range searching
- (1989) Journal of the American Mathematical Society , vol.2 , pp. 637-666
- Chazelle, B.¹

11
- 0039173457
- Cutting hyperplanes for divide-and-conquer
- (1993) Discrete Comput. Geom. , vol.9 , pp. 145-158
- Chazelle, B.¹

12
- 0026191608
- A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
- (1991) Theoret. Comput. Sci. , vol.84 , pp. 77-105
- Chazelle, B.¹ Edelsbrunner, H.² Guibas, L.³ Sharir, M.⁴

13
- 84936648002
- B. Chazelle, H. Edelsbrunner, L. Guibas M. Sharir, and J. Stolfi. Lines in space: combinatorics and algorithms. Proc. 21st ACM Symposium on Theory of Computing, 1989, pp. 382–393. Also to appear in Algorithmica.

14
- 33244480878
- A deterministic view of random sampling and its use in geometry
- (1990) Combinatorica , vol.10 , pp. 229-249
- Chazelle, B.¹ Friedman, J.²

15
- 0347108150
- Visibility and intersection problems in plane geometry
- (1989) Discrete Comput. Geom. , vol.4 , pp. 551-589
- Chazelle, B.¹ Guibas, L.²

16
- 52449144938
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- (1992) Algorithmica , vol.8 , pp. 407-430
- Chazelle, B.¹ Sharir, M.² Welzl, E.³

17
- 0000690281
- Quasi-optimal range searching in spaces of finite VC-dimension
- (1989) Discrete Comput. Geom. , vol.4 , pp. 467-490
- Chazelle, B.¹ Welzl, E.²

18
- 0024054715
- A randomized algorithm for closest-point queries
- (1988) SIAM J. Comput. , vol.17 , pp. 830-847
- Clarkson, K.L.¹

19
- 0001702902
- New applications of random sampling in computational geometry, II
- (1989) Discrete Comput. Geom. , vol.4 , pp. 387-421
- Clarkson, K.L.¹ Shor, P.²

20
- 38249034526
- Space searching for intersecting objects
- (1987) J. Algorithms , vol.8 , pp. 348-361
- Dobkin, D.¹ Edelsbrunner, H.²

21
- 0003516674
- Springer-Verlag, Berlin
- (1987) Algorithms in Combinatorial Geometry
- Edelsbrunner, H.¹

22
- 15744365331
- ε-nets and simplex range queries
- (1987) Discrete Comput. Geom. , vol.2 , pp. 127-151
- Haussler, D.¹ Welzl, E.²

23
- 84936648001
- J. Hershberger and S. Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 54–63.

24
- 0000375141
- Almost tight bounds for epsilon-nets
- (1992) Discrete Comput. Geom. , vol.7 , pp. 163-173
- Komlós, J.¹ Pach, J.² Wöginger, G.³

25
- 84936647974
- J. Matoušek. Approximations and optimal geometric divide-and-conquer. Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 506–511.

26
- 51249176533
- Cutting hyperplane arrangements
- (1991) Discrete Comput. Geom. , vol.6 , pp. 385-406
- Matoušek, J.¹

27
- 21144462806
- Efficient partition trees
- (1992) Discrete Comput. Geom. , vol.8 , pp. 315-334
- Matoušek, J.¹

28
- 0001456187
- Reporting points in half- spaces
- (1992) Comput. Geom. Theory Appl. , vol.2 , pp. 169-186
- Matoušek, J.¹

29
- 51249161633
- Range searching with efficient hierarchical cuttings
- (1993) Discrete Comput. Geom. , vol.10 , pp. 183-196
- Matoušek, J.¹

30
- 0006627264
- Ray shooting in 3-dimensional spaces
- (1993) Algorithmica , vol.9 , pp. 471-494
- Pellegrini, M.¹

31
- 0003487647
- Springer-Verlag, New York
- (1985) Computational Geometry—An Introduction
- Preparata, F.¹ Shamos, M.I.²

32
- 0004104851
- Cambridge University Press, Cambridge
- (1951) Analytical Geometry in Three Dimensions
- Sommerville, D.¹

33
- 0000392470
- Some Vapnik-Chervonenkis classes
- (1981) Discrete Math. , vol.33 , pp. 313-318
- Wenocur, R.¹ Dudley, R.²

34
- 0000949343
- Polygon retrieval
- (1982) SIAM Journal on Computing , vol.11 , pp. 149-165
- Willard, D.E.¹

35
- 84936647977
- F. F. Yao and A. C. Yao. A general approach to geometric queries. Proc. 17th ACM Symposium on Theory of Computing, 1985, pp. 163–168.

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