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

메뉴 건너뛰기

Discrete & Computational Geometry

Volumn 6, Issue 1, 1991, Pages 423-434

Small-dimensional linear programming and convex hulls made easy

(1) Seidel, Raimund a

a UNIVERSITY OF CALIFORNIA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51249172581 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02574699 Document Type: Article

Times cited : (180)

References (20)

1
- 84936706641
- [AS] C. R. Aragon and R. G. Seidel, Randomized Search Trees, Proc. 30th IEEE Symp. on Foundations of Computer Science (1989), pp. 540–545.

2
- 0014705383
- An Algorithm for Convex Polytopes
- (1970) Journal of the ACM , vol.17 , pp. 78-86
- Chand, D.R.¹ Kapur, S.S.²

3
- 0023039926
- Linear Programming in O(n3^d2) Time
- (1986) Inform. Process. Lett. , vol.22 , pp. 21-24
- Clarkson, K.L.¹

4
- 84936706639
- [C2] K. L. Clarkson, Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small, Manuscript Oct. 1989: a preliminary version appeared in Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), pp. 452–456.

5
- 0001702902
- Applications of Random Sampling in Computational Geometry, II
- (1989) Discrete Comput. Geom. , vol.4 , pp. 387-422
- Clarkson, K.L.¹ Shor, P.W.²

6
- 0021372387
- Linear Algorithms for Two- and Three-Variable Linear Programs
- (1984) SIAM J. Comput. , vol.13 , pp. 31-45
- Dyer, M.E.¹

7
- 0022769162
- On a Multidimensional Search Technique and Its Applications to the Euclidean One-Centre Problem
- (1986) SIAM J. Comput. , vol.15 , pp. 725-738
- Dyer, M.E.¹

8
- 34249964420
- A Randomized Algorithm for Fixed-Dimensional Linear Programming
- (1989) Math. Programming , vol.44 , pp. 203-212
- Dyer, M.E.¹ Frieze, A.M.²

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

10
- 49649136358
- An Efficient Algorithm for Constructing the Convex Hull of a Finite Planar Set
- (1972) Inform. Process. Lett. , vol.1 , pp. 132-133
- Graham, R.L.¹

11
- 84936706638
- [K] M. Kallay, Convex Hull Algorithms in Higher Dimensions, Manuscript (1981).

12
- 84976163829
- The Maximum Number of Faces of a Convex Polytope
- (1971) Mathematika , vol.17 , pp. 179-184
- McMullen, P.¹

13
- 0000423548
- Linear-Time Algorithms for Linear Programming in ℝ³ and Related Problems
- (1983) SIAM Journal on Computing , vol.12 , pp. 759-776
- Megiddo, N.¹

14
- 0020845843
- Linear Programming in Linear Time when the Dimension is Fixed
- (1984) Journal of the ACM , vol.31 , pp. 114-127
- Megiddo, N.¹

15
- 0017453547
- Convex Hulls of Finite Point Sets in Two and Three Dimensions
- (1977) Comm. ACM , vol.20 , pp. 87-93
- Preparata, F.P.¹ Hong, S.J.²

16
- 84936706637
- [S1] R. Seidel, A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions, Technical Report 81-14, Department of Computer Science, University of British Columbia (1981).

17
- 84936706610
- [S2] R. Seidel, Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face, Proc. 18th ACM Symp. on Theory of Computing (1986), pp. 404–413.

18
- 84936706609
- [S3] R. Seidel, Backwards Analysis of Randomized Geometric Algorithms (Manuscript).

19
- 0002448492
- Finding the Convex Hull Facet by Facet
- (1985) J. Algorithms , vol.6 , pp. 17-48
- Swart, G.¹

20
- 0004190201
- Society for Industrial and Applied Mathematics, Philadelphia, PA
- (1983) Data Structures and Network Algorithm
- Tarjan, R.E.¹

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