메뉴 건너뛰기




Volumn 8, Issue 2, 1997, Pages 67-86

Fast greedy triangulation algorithms

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0348050331     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)89149-3     Document Type: Article
Times cited : (10)

References (42)
  • 1
    • 0001253834 scopus 로고
    • A linear time algorithm for computing the Voronoi diagram of a convex polygon
    • A. Aggarwal, L.J. Guibas, J. Saxe and P. Shor, A linear time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom. 4 (1989) 591-604.
    • (1989) Discrete Comput. Geom. , vol.4 , pp. 591-604
    • Aggarwal, A.1    Guibas, L.J.2    Saxe, J.3    Shor, P.4
  • 5
    • 0021628110 scopus 로고
    • On the average length of Delaunay triangulations
    • R.C. Chang and R.C.T. Lee, On the average length of Delaunay triangulations, BIT 24 (1984) 269-273.
    • (1984) BIT , vol.24 , pp. 269-273
    • Chang, R.C.1    Lee, R.C.T.2
  • 8
    • 0345779310 scopus 로고
    • Expected rank of the longest edge in the greedy triangulation
    • M. Dickerson, Expected rank of the longest edge in the greedy triangulation, in: Proc. 4th Canadian Conf. Comput. Geom. (1992) 182-187.
    • (1992) Proc. 4th Canadian Conf. Comput. Geom. , pp. 182-187
    • Dickerson, M.1
  • 9
    • 0025474115 scopus 로고
    • Fixed-radius near neighbors search algorithms for points and segments
    • M. Dickerson and R.S. Drysdale, Fixed-radius near neighbors search algorithms for points and segments, Inform. Process. Lett. 35 (1990) 269-273.
    • (1990) Inform. Process. Lett. , vol.35 , pp. 269-273
    • Dickerson, M.1    Drysdale, R.S.2
  • 10
    • 0001457885 scopus 로고
    • Simple algorithms for enumerating interpoint distances and finding k nearest neighbors
    • M. Dickerson, R.L. Drysdale and J.-R. Sack, Simple algorithms for enumerating interpoint distances and finding k nearest neighbors, Internat. J. Comput. Geom. Appl. 3 (1992) 221-239.
    • (1992) Internat. J. Comput. Geom. Appl. , vol.3 , pp. 221-239
    • Dickerson, M.1    Drysdale, R.L.2    Sack, J.-R.3
  • 12
    • 0001077595 scopus 로고
    • Automatische Interpolation von Isolinien bei willkürlich verteilten Stützpunkten
    • R.D. Düppe and H.J. Gottschalk, Automatische Interpolation von Isolinien bei willkürlich verteilten Stützpunkten, Allgemeine Vermessungsnachrichten 77 (1970) 423-426.
    • (1970) Allgemeine Vermessungsnachrichten , vol.77 , pp. 423-426
    • Düppe, R.D.1    Gottschalk, H.J.2
  • 13
    • 84922418531 scopus 로고
    • New algorithms and empirical findings on minimum weight triangulation heuristics
    • M. Dickerson, S. McElfresh and M. Montague, New algorithms and empirical findings on minimum weight triangulation heuristics, in: Proc. 11th ACM Symp. Comput. Geom. (1995) 238-247.
    • (1995) Proc. 11th ACM Symp. Comput. Geom. , pp. 238-247
    • Dickerson, M.1    McElfresh, S.2    Montague, M.3
  • 15
    • 0024662251 scopus 로고
    • A space efficient greedy triangulation algorithm
    • S. Goldman, A space efficient greedy triangulation algorithm, Inform. Process. Lett. 31 (1989) 191-196.
    • (1989) Inform. Process. Lett. , vol.31 , pp. 191-196
    • Goldman, S.1
  • 16
    • 0347700161 scopus 로고
    • New results for the minimum weight triangulation problem
    • Virginia Polytechnic Institute and State University, Department of Computer Science, TR 92-30
    • L. Heath and S. Pemmaraju, New results for the minimum weight triangulation problem, Virginia Polytechnic Institute and State University, Department of Computer Science, TR 92-30 (1992), to appear in Algorithmica.
    • (1992) Algorithmica
    • Heath, L.1    Pemmaraju, S.2
  • 17
    • 0015599132 scopus 로고
    • On the identification of the convex hull of a finite set of points in the plane
    • R. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Inform. Process. Lett. 2 (1973) 18-21.
    • (1973) Inform. Process. Lett. , vol.2 , pp. 18-21
    • Jarvis, R.1
  • 18
    • 0006938345 scopus 로고
    • A note on Delaunay and optimal triangulations
    • D. Kirkpatrick, A note on Delaunay and optimal triangulations, Inform. Process. Lett. 10 (1980) 127-128.
    • (1980) Inform. Process. Lett. , vol.10 , pp. 127-128
    • Kirkpatrick, D.1
  • 19
    • 0000775283 scopus 로고    scopus 로고
    • Minimal triangulations of polygonal domains
    • G. Klincsek, Minimal triangulations of polygonal domains, Ann. Discrete Math. 9 121-123.
    • Ann. Discrete Math. , vol.9 , pp. 121-123
    • Klincsek, G.1
  • 20
    • 0000508273 scopus 로고
    • Generalized Delaunay triangulations for planar graphs
    • D.T. Lee and A.K. Lin, Generalized Delaunay triangulations for planar graphs, Discrete Comput. Geom. 1 (1986) 201-217.
    • (1986) Discrete Comput. Geom. , vol.1 , pp. 201-217
    • Lee, D.T.1    Lin, A.K.2
  • 21
    • 0040243537 scopus 로고
    • Enumerating the k-closest pairs optimally
    • H.P. Lenhof and M. Smid, Enumerating the k-closest pairs optimally, in: Proc. 33rd FOCS (1992) 380-386.
    • (1992) Proc. 33rd FOCS , pp. 380-386
    • Lenhof, H.P.1    Smid, M.2
  • 22
    • 0023367455 scopus 로고
    • An Ω(√n) lower bound for the nonoptimality of the greedy triangulation
    • C. Levcopoulos, An Ω(√n) lower bound for the nonoptimality of the greedy triangulation, Inform. Process. Lett. 25 (1987) 247-251.
    • (1987) Inform. Process. Lett. , vol.25 , pp. 247-251
    • Levcopoulos, C.1
  • 24
    • 0023209499 scopus 로고
    • On approximating behavior of the greedy triangulation for convex polygons
    • C. Levcopoulos and A. Lingas, On approximating behavior of the greedy triangulation for convex polygons, Algorithmica 2 (1987) 175-193.
    • (1987) Algorithmica , vol.2 , pp. 175-193
    • Levcopoulos, C.1    Lingas, A.2
  • 25
    • 0043272288 scopus 로고
    • Fast algorithms for greedy triangulation
    • C. Levcopoulos and A. Lingas, Fast algorithms for greedy triangulation, BIT 32 (1992) 280-296.
    • (1992) BIT , vol.32 , pp. 280-296
    • Levcopoulos, C.1    Lingas, A.2
  • 27
    • 0023039921 scopus 로고
    • The greedy and Delaunay triangulations are not bad in the average case
    • A. Lingas, The greedy and Delaunay triangulations are not bad in the average case, Inform. Process. Lett. 22 (1986) 25-31.
    • (1986) Inform. Process. Lett. , vol.22 , pp. 25-31
    • Lingas, A.1
  • 28
    • 0347671440 scopus 로고
    • On approximating behavior and implementation of the greedy triangulation for convex planar point sets
    • A. Lingas, On approximating behavior and implementation of the greedy triangulation for convex planar point sets, in: Proc. 2nd ACM Symp. Comput. Geom. (1986) 72-79.
    • (1986) Proc. 2nd ACM Symp. Comput. Geom. , pp. 72-79
    • Lingas, A.1
  • 29
    • 0000024829 scopus 로고
    • A new heuristic for the minimum weight triangulation
    • A. Lingas, A new heuristic for the minimum weight triangulation, SIAM J. Algebraic Discrete Meth. 8 (1986) 646-658.
    • (1986) SIAM J. Algebraic Discrete Meth. , vol.8 , pp. 646-658
    • Lingas, A.1
  • 30
    • 84877620754 scopus 로고
    • Greedy triangulation can be efficiently implemented in the average case
    • A. Lingas, Greedy triangulation can be efficiently implemented in the average case, in: Proc. Graph-Theoretic Concepts in Computer Science (1988) 253-261.
    • (1988) Proc. Graph-Theoretic Concepts in Computer Science , pp. 253-261
    • Lingas, A.1
  • 31
    • 85052097933 scopus 로고
    • On triangulations of a set of points in the plane
    • E. Lloyd, On triangulations of a set of points in the plane, in: Proc. 18th FOCS (1977) 228-240.
    • (1977) Proc. 18th FOCS , pp. 228-240
    • Lloyd, E.1
  • 32
    • 0001773747 scopus 로고
    • Neither the greedy nor the Delaunay triangulation of the planar set approximates the optimal triangulation
    • G. Manacher and A. Zobrist, Neither the greedy nor the Delaunay triangulation of the planar set approximates the optimal triangulation, Inform. Process. Lett. 9 (1979) 31-34.
    • (1979) Inform. Process. Lett. , vol.9 , pp. 31-34
    • Manacher, G.1    Zobrist, A.2
  • 33
    • 0347671438 scopus 로고
    • Probabilistic methods with heaps for fast-average-case greedy algorithms
    • G. Manacher and A. Zobrist, Probabilistic methods with heaps for fast-average-case greedy algorithms, Advances in Computing Research 1 (1983) 261-278.
    • (1983) Advances in Computing Research , vol.1 , pp. 261-278
    • Manacher, G.1    Zobrist, A.2
  • 34
    • 0000393305 scopus 로고
    • A heuristic triangulation algorithm
    • D.A. Plaisted and J. Hong, A heuristic triangulation algorithm, J. Algorithms 8 (1987) 405-437.
    • (1987) J. Algorithms , vol.8 , pp. 405-437
    • Plaisted, D.A.1    Hong, J.2
  • 36
    • 0001888582 scopus 로고
    • Über die konvexe Hülle von n zufällig gewählten Punkten
    • A. Rényi and R. Sulanke, Über die konvexe Hülle von n zufällig gewählten Punkten, I, Z. Wahrsch. Verw. Gebiete 2 (1963) 75-84.
    • (1963) I, Z. Wahrsch. Verw. Gebiete , vol.2 , pp. 75-84
    • Rényi, A.1    Sulanke, R.2
  • 38
    • 0042269802 scopus 로고
    • Efficiently updating the constrained Delaunay triangulations
    • C.A. Wang, Efficiently updating the constrained Delaunay triangulations, BIT 33 (1993) 238-252.
    • (1993) BIT , vol.33 , pp. 238-252
    • Wang, C.A.1
  • 39
    • 0042771000 scopus 로고
    • An optimal algorithm for greedy triangulation of a set of points
    • C.A. Wang, An optimal algorithm for greedy triangulation of a set of points, in: Proc. 6th Canadian Conf. Comput. Geom. (1994) 332-338.
    • (1994) Proc. 6th Canadian Conf. Comput. Geom. , pp. 332-338
    • Wang, C.A.1
  • 40
    • 0022562669 scopus 로고
    • Surface reconstruction and representation of 3D scenes
    • Y.F. Wang and J.K. Aggarwal, Surface reconstruction and representation of 3D scenes, Pattern Recognition 19 (1986) 197-207.
    • (1986) Pattern Recognition , vol.19 , pp. 197-207
    • Wang, Y.F.1    Aggarwal, J.K.2
  • 41
    • 84976861822 scopus 로고
    • An optimal algorithm for constructing the Delaunay triangulation of a set of line segment
    • C.A. Wang and L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segment, in: Proc. 3rd ACM Symp. Comput. Geom. (1987) 223-232.
    • (1987) Proc. 3rd ACM Symp. Comput. Geom. , pp. 223-232
    • Wang, C.A.1    Schubert, L.2
  • 42
    • 0004487889 scopus 로고
    • Compilation of data for computer-assisted relief cartography
    • J.C. Davis and M.J. McCullagh, eds., Wiley, New York
    • P. Yoeli, Compilation of data for computer-assisted relief cartography, in: J.C. Davis and M.J. McCullagh, eds., Display and Analysis of Spatial Data (Wiley, New York, 1975).
    • (1975) Display and Analysis of Spatial Data
    • Yoeli, P.1


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