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

메뉴 건너뛰기

Volumn 7, Issue 1-6, 1992, Pages 381-413

Randomized incremental construction of Delaunay and Voronoi diagrams

(3) Guibas, Leonidas J a,b Knuth, Donald E a Sharir, Micha c,d

a STANFORD UNIVERSITY (United States)

b HEWLETT PACKARD COMPANY (United States)

c NEW YORK UNIVERSITY (United States)

d TEL AVIV UNIVERSITY (Israel)

Author keywords

Delaunay triangulation; randomized algorithms; Voronoi diagram

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGORITHMS; SURVEYING--TRIANGULATION;

DELAUNAY TRIANGULATION; VORONOI DIAGRAMS;

COMPUTER PROGRAMMING;

EID: 52449149247 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/BF01758770 Document Type: Article

Times cited : (356)

References (30)

1
- 84936655120
- A. Aggarwal, H. Imai, N. Katoh, and S. Suri, Finding k points with minimum diameter and related problems, Proc. 5th ACM Symp. on Computational Geometry, 1989, pp. 283–291.

2
- 0004100864
- Addison-Wesley, Reading, MA
- (1976) The Theory of Partitions
- Andrews, G.¹

3
- 33744681538
- A combinatorial result about points and balls in Euclidean space
- (1988) Discrete Comput. Geom. , vol.3 , pp. 259-262
- Bárány, I.¹ Schmerl, J.² Sidney, S.³ Urrutia, J.⁴

4
- 84976672179
- Optimal expected time algorithms for closest point problems
- (1980) ACM Transactions on Mathematical Software , vol.6 , pp. 563-580
- Bentley, J.¹ Weide, B.² Yao, A.³

5
- 84936655124
- J.-D. Boissonnat, and M. Teillaud, A hierarchical representation of objects: the Delaunay tree, Proc. 2nd ACM Symp. on Computational Geometry, 1986, pp. 260–268.

6
- 84936655082
- B. Chazelle, H. Edelsbrunner, L. Guibas, R. Seidel, and M. Sharir, Selecting multiply covered points and reducing the size of Delaunay triangulations, Manuscript, 1989.

7
- 84936655085
- P. Chew, The simplest Voronoi diagram algorithm takes linear expected time, Manuscript, 1988.

8
- 84936655087
- K. Clarkson, Personal communication, 1989.

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

10
- 0009074955
- Neue Darstellung der geometrischen Krystallographie
- (1932) Z. Kryst. , vol.84 , pp. 109-149
- Delaunay, B.¹

11
- 0001571646
- Sur la sphère vide
- (1934) Izv. Akad. Nauk SSSR. Otdel. Mat. Estestv. Nauk , vol.7 , pp. 793-800
- Delaunay, B.¹

12
- 84936655088
- R. Dwyer, Higher dimensional Voronoi diagrams in linear expected time, Proc. 5th ACM Symp. on Computational Geometry, 1989, pp. 326–333.

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

14
- 0022711327
- Optimal point location in a monotone subdivision
- (1986) SIAM J. Comput. , vol.15 , pp. 317-340
- Edelsbrunner, H.¹ Guibas, L.² Stolfi, J.³

15
- 84936655090
- H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, Circles through two points that always enclose many points, Technical Report UIUCDCS-R-88-1400, University of Illinois at Urbana, January 1988.

16
- 52449147685
- A sweepline algorithm for Voronoi diagrams
- (1987) Algorithmica , vol.2 , pp. 153-174
- Fortune, S.¹

17
- 84936655092
- S. Fortune, A note on Delaunay diagonal flips, Unpublished manuscript.

18
- 77957180267
- Computing Dirichlet tesselation in the plane
- (1977) Comput. J. , vol.21 , pp. 168-173
- Green, P.¹ Sibson, R.²

19
- 84936655094
- L. Guibas and M. Sharir, History helps queries, In preparation.

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

21
- 84936655093
- J. Jaromczyk and G. Swiatek, Degenerate cases do not require more memory, Manuscript, 1989.

22
- 0002429537
- Optimal search in planar subdivisions
- (1983) SIAM Journal on Computing , vol.12 , pp. 28-35
- Kirkpatrick, D.¹

23
- 0003657590
- Addison-Wesley, Reading, MA
- (1973) The Art of Computer Programming, Vol. 3
- Knuth, D.E.¹

24
- 84936655096
- K. Mehlhorn, S. Meiser, and C. Ó'Dúnlaing, On the construction of abstract Voronoi diagrams, Manuscript, 1989.

25
- 84936655095
- K. Mulmuley, A fast planar partition algorithm, Technical Report 88-107, Department of Computer Science, University of Chicago, May 1988.

26
- 0003487647
- Springer-Verlag, Berlin
- (1985) Computational Geometry-An Introduction
- Preparata, F.¹ Shamos, M.²

27
- 84936655253
- F. Preparata and R. Tamassia, Fully dynamic techniques for point location and transitive closure in planar structures, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 558–567.

28
- 84936655252
- R. Seidel, Private communication.

29
- 0000734331
- Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier Mémoire: Sur quelques proprieteés des formes quadratiques positives parfaites
- (1907) J. Reine Angew. Math. , vol.133 , pp. 97-178
- Voronoi, G.¹

30
- 84927514013
- Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième Mémoire: Recherches sur les parallélloèdres primitifs
- (1908) J. Reine Angew. Math. , vol.134 , pp. 198-287
- Voronoi, G.¹

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