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

메뉴 건너뛰기

Discrete & Computational Geometry

Volumn 10, Issue 1, 1993, Pages 377-409

An optimal convex hull algorithm in any fixed dimension

(1) Chazelle, Bernard a

a PRINCETON UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51249162153 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02573985 Document Type: Article

Times cited : (284)

References (23)

1
- 0039592885
- Partitioning arrangements of lines, I: An efficient deterministic algorithm
- (1990) Discrete Comput. Geom. , vol.5 , pp. 449-483
- Agarwal, P.K.¹

2
- 0018768186
- Voronoi diagrams from convex hulls
- (1979) Inform. Process. Lett. , vol.9 , pp. 223-228
- Brown, K.Q.¹

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

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

5
- 84936635855
- Chazelle, B., Matoušek, J. Derandomizing an output-sensitive convex hull algorithm in three dimensions (submitted for publication).

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

7
- 84936635852
- Clarkson, K. L. Randomized geometric algorithms, in Euclidean Geometry and Computers, D. Z. Du and F. K. Hwang, eds., World Scientific, to appear.

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

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

10
- 34250131231
- Voronoi diagrams and arrangements
- (1986) Discrete Comput. Geom. , vol.1 , pp. 25-44
- Edelsbrunner, H.¹ Seidel, R.²

11
- 49649136358
- An efficient algorithm for determining the convex hull of a planar point set
- (1972) Inform. Process. Lett. , vol.1 , pp. 132-133
- Graham, R.L.¹

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

13
- 84936635853
- Matoušek, J. Approximations and optimal geometric divide-and-conquer, Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991, pp. 505–511.

14
- 84936635850
- Matoušek, J. Efficient partition trees, Proc. 7th Annual ACM Symp. on Computational Geometry, 1991, pp. 1–9.

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

16
- 84936635851
- Matoušek, J. Linear optimization queries, J. Algorithms, to appear.

17
- 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.²

18
- 0000435276
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- (1988) J. Comput. System Sci. , vol.37 , pp. 130-143
- Raghavan, P.¹

19
- 84936635847
- Seidel, R. A convex hull algorithm optimal for point sets in even dimensions, Technical Report 81-14, University of British Columbia, 1981.

20
- 84936635848
- Seidel, R. Constructing higher-dimensional convex hulls at logarithmic cost per face, Proc. 18th Annual ACM Symp. on Theory of Computing, 1986, pp. 404–413.

21
- 51249172581
- Small-dimensional linear programming and convex hulls made easy
- (1991) Discrete Comput. Geom. , vol.6 , pp. 423-434
- Seidel, R.¹

22
- 0003802869
- CBMS-NSF, SIAM, Philadelphia, PA
- (1987) Ten Lectures on the Probabilistic Method
- Spencer, J.¹

23
- 0001024505
- On the uniform convergence of relative frequencies of events to their probabilities
- (1971) Theory of Probability & Its Applications , vol.16 , pp. 264-280
- Vapnik, V.N.¹ Chervonenkis²

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