메뉴 건너뛰기




Volumn 28, Issue 2, 1998, Pages 471-486

Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY;

EID: 0032107935     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795285916     Document Type: Article
Times cited : (36)

References (1)
  • 1
    • 26444439778 scopus 로고
    • Computational Geometry
    • MIT, Cambridge, MA
    • A. AGGARWAL (1988), Computational Geometry, MIT Lecture Notes 18.409, MIT, Cambridge, MA.
    • (1988) MIT Lecture Notes 18.409
    • Aggarwal, A.1


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