SCOPUS 정보 검색 플랫폼

Discrete & Computational Geometry

Volumn 4, Issue 1, 1989, Pages 387-421

Applications of random sampling in computational geometry, II

(2) Clarkson, Kenneth L a Shor, Peter W a

a LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001702902 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02187740 Document Type: Article

Times cited : (799)

References (44)

1
- 84936554625
- P. K. Agarwal. An efficient deterministic algorithm for partitioning arrangements of lines and its applications. In Proceedings of the Fifth Symposium on Computational Geometry, pages 11–22, 1989.

2
- 84936554620
- A. Aggarwal. Personal communication.

3
- 38249043947
- The number of small semispaces of a finite set of points in the plane
- (1986) J. Combin. Theory Ser. A , vol.41 , pp. 154-157
- Alon, N.¹ Györi, E.²

4
- 84936554619
- N. Alon, D. Haussler, and E. Welzl. Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension. In Proceedings of the Third Symposium on Computational Geometry, pages 331–340, 1987.

5
- 84936554622
- B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 590–600, 1988.

6
- 0021788174
- The power of geometric duality
- (1985) BIT , vol.25 , pp. 76-90
- Chazelle, B.¹ Guibas, L.J.² Lee, D.T.³

7
- 0038522287
- Halfspace range search: an algorithmic application of k-sets
- (1986) Discrete Comput. Geom. , vol.1 , pp. 83-93
- Chazelle, B.¹ Preparata, F.P.²

8
- 84936554621
- Technical Report, B-88-09, Freie Universität Berlin, Institut für Mathematik III, Arnimallee 2-6, 1000 Berlin 33
- (1989) Range searching and VC-dimension: a characterization of efficiency
- Chazelle, B.¹ Welzl, E.²

9
- 84936554627
- L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Unpublished manuscript, 1986.

10
- 84936554628
- K. L. Clarkson. A probabilistic algorithm for the post office problem. In Proceedings of the 17th Annual SIGACT Symposium, pages 175–184, 1985.

11
- 0037765301
- New applications of random sampling in computational geometry
- (1987) Discrete Comput. Geom. , vol.2 , pp. 195-222
- Clarkson, K.L.¹

12
- 84936554629
- B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in computational geometry. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 539–549, 1988.

13
- 84936554601
- K. L. Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 452–456, 1988. Revised version: Las Vegas algorithms for linear and integer programming when the dimension is small (preprint).

14
- 84936554603
- K. L. Clarkson. Applications of random sampling in computational geometry, II. In Proceedings of the Fourth Symposium on Computational Geometry, pages 1–11, 1988.

15
- 84936554604
- K. L. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl. Combinatorial complexity bounds for arrangements of curves and surfaces. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 568–579, 1988.

16
- 84936554605
- K. L. Clarkson and P. W. Shor. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. In Proceedings of the Fourth Symposium on Computational Geometry, pages 12–17, 1988.

17
- 84936554606
- K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk. A fast Las Vegas algorithm for triangulating a simple polygon. Discrete Comput. Geom., this issue, pages 423–432.

18
- 0023288651
- On k-hulls and related problems
- (1987) SIAM J. Comput. , vol.16 , pp. 61-77
- Cole, R.¹ Sharir, M.² Yap, C.³

19
- 84936554607
- H. Edelsbrunner. Personal communication.

20
- 0003516674
- Springer-Verlag, New York
- (1987) Algorithms in Combinatorial Geometry
- Edelsbrunner, H.¹

21
- 0020780410
- On the shape of a set of points in the plane
- (1983) IEEE Transactions on Information Theory , vol.29 , pp. 551-559
- Edelsbrunner, H.¹ Kirkpatrick, D.G.² Seidel, R.³

22
- 84936554608
- H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. In Proceedings of the Fourth Symposium on Computational Geometry, pages 118–113, 1988.

23
- 0022714544
- Constructing arrangements of lines and hyperplanes with applications
- (1986) SIAM J. Comput. , vol.15 , pp. 341-363
- Edelsbrunner, H.¹ O'Rourke, J.² Seidel, R.³

24
- 0004096503
- Academic Press, New York
- (1974) Probabilistic Methods in Combinatorics
- Erdös, P.¹ Spencer, J.²

25
- 0012577641
- On the number of k-subsets of a set of n points in the plane
- (1984) J. Combin. Theory Ser. A , vol.36 , pp. 101-104
- Goodman, J.E.¹ Pollack, R.E.²

26
- 0004172239
- Birkhäuser, Boston
- (1981) Mathematics for the Analysis of Algorithms
- Greene, D.H.¹ Knuth, D.E.²

27
- 84942026338
- Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
- (1985) ACM Trans. Graphics , vol.4 , pp. 75-123
- Guibas, L.J.¹ Stolfi, J.²

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

29
- 0040408333
- Beweis einer Vermutung von A. Vázsonyi
- (1956) Acta Math. Acad. Sci. Hungar. , vol.7 , pp. 463-466
- Heppes, A.¹

30
- 0002217386
- Quicksort
- (1962) The Computer Journal , vol.5 , pp. 10-15
- Hoare, C.A.R.¹

31
- 0022663183
- The ultimate planar convex hull algorithm?
- (1986) SIAM J. Comput. , vol.15 , pp. 287-299
- Kirkpatrick, D.G.¹ Seidel, R.²

32
- 84936554595
- J. Matoušek. Construction of ɛ-nets. In Proceedings of the Fifth Symposium on Computational Geometry, pages 1–10, 1989.

33
- 0020845843
- Linear programming in linear time when the dimension is fixed
- (1984) Journal of the ACM , vol.31 , pp. 114-127
- Megiddo, N.¹

34
- 0000940859
- Finding the intersection of two convex polyhedra
- (1978) Theoret. Comput. Sci. , vol.7 , pp. 217-236
- Muller, D.E.¹ Preparata, F.P.²

35
- 84936554593
- K. Mulmuley. A fast planar partition algorithm: part I. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 580–589, 1988.

36
- 0017453547
- Convex hulls of finite sets of points in two and three dimensions
- (1977) Comm. ACM , vol.20 , pp. 87-93
- Preparata, F.P.¹ Hong, S.J.²

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

38
- 84936554599
- J. Reif and S. Sen. Optimal parallel algorithms for computational geometry. In Proceedings of the 16th International Conference on Parallel Processing, 1987.

39
- 84936554598
- J. Reif and S. Sen. Polling: a new randomized sampling technique for computational geometry. In Proceedings of the 21st Annual SIGACT Symposium, pages 394–404, 1989.

40
- 84936554572
- R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. Technical Report 81/14, Dept. Computer Science, University of British Columbia, 1981.

41
- 84936554574
- R. Seidel. Constructing higher dimensional convex hulls at logarithmic cost per face. In Proceedings of the 18th Annual SIGACT Symposium, pages 404–413, 1986.

42
- 0011638478
- More on k-sets of finite sets in the plane
- (1986) Discrete Comput. Geom. , vol.1 , pp. 95-100
- Welzl, E.¹

43
- 84936554569
- E. Welzl. Partition trees for triangle counting and other range searching problems. In Proceedings of the Fourth Symposium on Computational Geometry, pages 23–33, 1988.

44
- 84936554570
- C. K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. In Proceedings of the Fourth Symposium on Computational Geometry, pages 134–142, 1988.

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