메뉴 건너뛰기




Volumn 1969, Issue , 2000, Pages 564-576

Optimal polygon cover problems and applications

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

EID: 84949761201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_48     Document Type: Conference Paper
Times cited : (2)

References (21)
  • 4
    • 0010423824 scopus 로고
    • A Polynomial Solution for the Potato-Peeling Problem
    • J.S. Chang and C.K. Yap, A Polynomial Solution for the Potato-Peeling Problem, Discrete Comput. Geom., 1(1986), 155-182.
    • (1986) Discrete Comput. Geom. , vol.1 , pp. 155-182
    • Chang, J.S.1    Yap, C.K.2
  • 5
    • 51249179364 scopus 로고
    • Triangulating a Simple Polygon in Linear Time
    • B. Chazelle, Triangulating a Simple Polygon in Linear Time, Discrete Comput. Geom., 6(1991), 485-524.
    • (1991) Discrete Comput. Geom. , vol.6 , pp. 485-524
    • Chazelle, B.1
  • 10
    • 0033450714 scopus 로고    scopus 로고
    • Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
    • D. Eppstein and J. Erickson, Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions, Discrete Comput. Geom., 22(1999), 569-592.
    • (1999) Discrete Comput. Geom. , vol.22 , pp. 569-592
    • Eppstein, D.1    Erickson, J.2
  • 13
    • 0026239341 scopus 로고
    • An Output-Sensitive Algorithm for Computing Visibility Graphs
    • S.K. Ghosh and D.M. Mount, An Output-Sensitive Algorithm for Computing Visibility Graphs, SIAM J. Comput., 20(1991), 888-910.
    • (1991) SIAM J. Comput. , vol.20 , pp. 888-910
    • Ghosh, S.K.1    Mount, D.M.2
  • 15
    • 52449146609 scopus 로고
    • Linear-Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons
    • L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan, Linear-Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons, Algorithmica, 2(1987), 209-233.
    • (1987) Algorithmica , vol.2 , pp. 209-233
    • Guibas, L.J.1    Hershberger, J.2    Leven, D.3    Sharir, M.4    Tarjan, R.E.5
  • 16
    • 0000855328 scopus 로고
    • Computing Minimum Length Paths of a Given Homotopy Class
    • J. Hershberger and J. Snoeyink, Computing Minimum Length Paths of a Given Homotopy Class, Comput. Geom. Theory Appl., 9(1994), 63-98.
    • (1994) Comput. Geom. Theory Appl. , vol.9 , pp. 63-98
    • Hershberger, J.1    Snoeyink, J.2
  • 17
    • 0021483844 scopus 로고
    • Euclidean Shortest Paths in the Presence of Rectilinear Barriers
    • D.T. Lee and F.P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers, Networks, 14(1984), 393-410.
    • (1984) Networks , vol.14 , pp. 393-410
    • Lee, D.T.1    Preparata, F.P.2
  • 18
    • 0001472827 scopus 로고    scopus 로고
    • On Some Geometric Optimization Problems in Layered Manufacturing
    • J. Majhi, R. Janardan, M. Smid, and P. Gupta, On Some Geometric Optimization Problems in Layered Manufacturing, Comput. Geom.: Theory Appl., 12(1999), 219-239.
    • (1999) Comput. Geom.: Theory Appl. , vol.12 , pp. 219-239
    • Majhi, J.1    Janardan, R.2    Smid, M.3    Gupta, P.4
  • 21
    • 0033181755 scopus 로고    scopus 로고
    • CARABEAMER: A Treatment Planner for a Robotic Radiosurgical System with General Kinematics, Medical Image Analysis
    • R. Tombropoulos, J.R. Adler, and J.C. Latombe, CARABEAMER: A Treatment Planner for a Robotic Radiosurgical System with General Kinematics, Medical Image Analysis, Medical Image Analysis, 3(1999), 1-28.
    • (1999) Medical Image Analysis , vol.3 , pp. 1-28
    • Tombropoulos, R.1    Adler, J.R.2    Latombe, J.C.3


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