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

메뉴 건너뛰기

Volumn 32, Issue 2, 1992, Pages 280-296

Fast algorithms for greedy triangulation

(2) Levcopoulos, Christos a Lingas, Andrzej a

a LUND UNIVERSITY (Sweden)

Author keywords

AMS categories: 05B40, 68A10, 68E99; time complexity; triangulation; Voronoi diagram

Indexed keywords

EID: 0043272288 PISSN: 00063835 EISSN: 15729125 Source Type: Journal
DOI: 10.1007/BF01994882 Document Type: Article

Times cited : (14)

References (17)

1
- 84936689666
- Research topics in computational geometry
- (1989) Bulletin of EATCS , vol.39 , pp. 388-408
- Aggarwal, A.¹

2
- 84936651156
- A. Aggarwal, L. Guibas, J. Saxe and P. Shor, A linear time algorithm for computing the Voronoi diagram of a convex polygon, in Proc. of the 19th ACM Symposium on Theory of Computing, New York, pp. 39–45, 1987.

3
- 84936651159
- L. P. Chew, Constrained Delaunay triangulations, in: Proc. of the 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 215–222, 1987.

4
- 0003415254
- Coordinated Science Laboratory, University of Illinois, Urbana, Illinois
- (1979) New Results in Planar Triangulations
- Gilbert, P.D.¹

5
- 0003516672
- Springer Verlag, Berlin
- (1987) Algorithms in Combinatorial Geometry, Texts and Monographs in Computer Science
- Edelsbrunner, H.¹

6
- 0024662251
- A space efficient greedy triangulation algorithm
- (1989) Information Processing Letters , vol.31 , pp. 191-196
- Goldman, S.A.¹

7
- 0023367455
- An Θ(√n) lower bound for non-optimality of the greedy triangulation
- (1987) Information Processing Letters , vol.25 , pp. 247-251
- Levcopoulos, C.¹

8
- 0000508273
- Generalized Delaunay Triangulation for Planar Graphs
- (1986) Discrete and Computational Geometry , vol.1 , pp. 201-217
- Lee, D.T.¹ Lin, A.²

9
- 0023209499
- On approximation behavior of the greedy triangulation for convex polygons
- (1987) Algorithmica , vol.2 , pp. 175-193
- Levcopoulos, C.¹ Lingas, A.²

10
- 0024716645
- Heuristics for optimum binary search trees and minimum weight triangulation problems
- (1989) Theoretical Computer Science , vol.66 , pp. 181-203
- Levcopoulos, C.¹ Lingas, A.² Sack, J.³

11
- 84909712299
- A space efficient algorithm for the greedy triangulation
- M., Thoma, A., Wyner, Proc. 13th IFIP Conf. on System Modelling and Optimization, Tokyo, August 1987, Springer, Berlin
- (1987) Lecture Notes in Control and Information Sciences, Vol. 113 , pp. 359-364
- Lingas, A.¹

12
- 84877620754
- Greedy triangulation can be efficiently implemented in the average case
- (1988) Lecture Notes in Computer Science , vol.344 , pp. 253-261
- Lingas, A.¹

13
- 0024738433
- Voronoi diagrams with barriers and their applications
- (1989) Information Processing Letters , vol.32 , pp. 191-198
- Lingas, A.¹

14
- 84936651158
- E. L. Lloyd, On triangulations of a set of points in the plane, Proc. of the 18th Annual IEEE Conference on the Foundations of Computer Science, Providence, 1977.

15
- 84936651190
- G. Manacher and A. Zorbrist, Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation, Information Processing Letters 9 (1979).

16
- 0003487647
- Springer Verlag, New York
- (1985) Computational Geometry, An Introduction, Texts and Monographs in Computer Science
- Preparata, F.P.¹ Shamos, M.I.²

17
- 84936651180
- C. Wang and L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, in: Proc of the 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 223–232, 1987.

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