메뉴 건너뛰기




Volumn 3669, Issue , 2005, Pages 355-366

I/O-efficient construction of constrained delaunay triangulations

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA REDUCTION; DATA STORAGE EQUIPMENT; INPUT OUTPUT PROGRAMS; SET THEORY;

EID: 27144510586     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_33     Document Type: Conference Paper
Times cited : (32)

References (17)
  • 2
    • 0024082546 scopus 로고
    • The input/output complexity of sorting and related problems
    • A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
    • (1988) Communications of the ACM , vol.31 , Issue.9 , pp. 1116-1127
    • Aggarwal, A.1    Vitter, J.S.2
  • 5
    • 0001781555 scopus 로고    scopus 로고
    • Voronoi diagrams
    • J.-R. Sack and J. Urrutia, editors. Elsevier Science Publishers B.V. North-Holland, Amsterdam
    • F. Aurenhammer and R. Klein. Voronoi diagrams. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 201-290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
    • (2000) Handbook of Computational Geometry , pp. 201-290
    • Aurenhammer, F.1    Klein, R.2
  • 6
    • 0000259094 scopus 로고    scopus 로고
    • Design and implementation of a practical parallel Delaunay algorithm
    • G. E. Blelloch, G. L. Miller, J. C. Hardwick, and D. Talmor. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica, 24(3):243-269, 1999.
    • (1999) Algorithmica , vol.24 , Issue.3 , pp. 243-269
    • Blelloch, G.E.1    Miller, G.L.2    Hardwick, J.C.3    Talmor, D.4
  • 8
    • 0038534791 scopus 로고
    • Constrained Delaunay triangulations
    • L. P. Chew. Constrained Delaunay triangulations. Algorithmica, 4:97-108, 1989.
    • (1989) Algorithmica , vol.4 , pp. 97-108
    • Chew, L.P.1
  • 9
    • 0001702902 scopus 로고
    • Applications of random sampling in computational geometry, II
    • K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
    • (1989) Discrete Comput. Geom. , vol.4 , pp. 387-421
    • Clarkson, K.L.1    Shor, P.W.2
  • 12
    • 52449149247 scopus 로고
    • Randomized incremental construction of Delaunay and Voronoi diagrams
    • L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
    • (1992) Algorithmica , vol.7 , pp. 381-413
    • Guibas, L.J.1    Knuth, D.E.2    Sharir, M.3
  • 13
    • 0344838279 scopus 로고    scopus 로고
    • I/O-efficient construction of voronoi diagrams
    • P. Kumar and E. A. Ramos. I/O-efficient construction of voronoi diagrams. Technical report, 2002.
    • (2002) Technical Report
    • Kumar, P.1    Ramos, E.A.2
  • 15
    • 27144540381 scopus 로고
    • Constrained Delaunay triangulations and Voronoi diagrams with obstacles
    • June. UC Berkeley
    • R. Seidel. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. Computer Science Division, ??, June 1989. UC Berkeley.
    • (1989) Computer Science Division, ??
    • Seidel, R.1
  • 16
    • 0002804341 scopus 로고    scopus 로고
    • Triangle: Engineering a 2d quality mesh generator and Delaunay triangulator
    • Association for Computing Machinery, May
    • J. R. Shewchuk. Triangle: engineering a 2d quality mesh generator and Delaunay triangulator. In First Workshop on Applied Computational Geometry. Association for Computing Machinery, May 1996.
    • (1996) First Workshop on Applied Computational Geometry
    • Shewchuk, J.R.1


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