메뉴 건너뛰기




Volumn 8, Issue 3, 1998, Pages 277-304

Determining weak visibility of a polygon from an edge in parallel

Author keywords

Computational geometry; CREW PRAM; Parallel algorithms; Simple polygons; Weak visibility

Indexed keywords


EID: 0032329311     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819599800014X     Document Type: Article
Times cited : (1)

References (43)
  • 3
    • 0347069384 scopus 로고
    • Finding a closest visible vertex pair between two polygons
    • N. M. Amato, "Finding a closest visible vertex pair between two polygons," Algorithmica, 14 (2) (1995), pp. 183-201.
    • (1995) Algorithmica , vol.14 , Issue.2 , pp. 183-201
    • Amato, N.M.1
  • 4
    • 0023833316 scopus 로고
    • Parallel algorithms for some functions of two convex polygons
    • M. J. Atallah and M. T. Goodrich, "Parallel algorithms for some functions of two convex polygons," Algorithmica, 3 (1988), pp. 535-548.
    • (1988) Algorithmica , vol.3 , pp. 535-548
    • Atallah, M.J.1    Goodrich, M.T.2
  • 5
    • 2842585064 scopus 로고
    • An optimal parallel algorithm for the visibility of a simple polygon from a point
    • M. J. Atallah, D. Z. Chen, and H. Wagener, "An optimal parallel algorithm for the visibility of a simple polygon from a point," J. of the ACM, 38 (3) (1991), pp. 516-533.
    • (1991) J. of the ACM , vol.38 , Issue.3 , pp. 516-533
    • Atallah, M.J.1    Chen, D.Z.2    Wagener, H.3
  • 6
    • 0019683897 scopus 로고
    • An optimal algorithm for determining the visibility polygon from an edge
    • D. Avis and G. T. Toussaint, "An optimal algorithm for determining the visibility polygon from an edge," IEEE Trans. Computers, C-30 (12) (1981), pp. 910-914.
    • (1981) IEEE Trans. Computers , vol.C-30 , Issue.12 , pp. 910-914
    • Avis, D.1    Toussaint, G.T.2
  • 9
    • 0346279545 scopus 로고
    • A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
    • B. K. Bhattacharya, A. Mukhopadhyay, and G. T. Toussaint, "A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible," Proc. Workshop on Algorithms and Data Structures, 1991, pp. 412-424.
    • (1991) Proc. Workshop on Algorithms and Data Structures , pp. 412-424
    • Bhattacharya, B.K.1    Mukhopadhyay, A.2    Toussaint, G.T.3
  • 10
    • 51249179364 scopus 로고
    • Triangulating a simple polygon in linear time
    • B. Chazelle, "Triangulating a simple polygon in linear time," Discrete & Computational Geometry, 6 (1991), pp. 485-524.
    • (1991) Discrete & Computational Geometry , vol.6 , pp. 485-524
    • Chazelle, B.1
  • 11
    • 0347108150 scopus 로고
    • Visibility and intersection problems in plane geometry
    • B. Chazelle and L. J. Guibas, "Visibility and intersection problems in plane geometry," Discrete & Computational Geometry, 4 (1989), pp. 551-581.
    • (1989) Discrete & Computational Geometry , vol.4 , pp. 551-581
    • Chazelle, B.1    Guibas, L.J.2
  • 12
    • 0346928755 scopus 로고
    • Parallel techniques for paths, visibility, and related problems
    • Ph.D. thesis, Department of Computer Sciences, Purdue University, July
    • D. Z. Chen, "Parallel techniques for paths, visibility, and related problems," Ph.D. thesis, Technical Report No. 92-051, Department of Computer Sciences, Purdue University, July 1992.
    • (1992) Technical Report No. 92-051 , vol.92 , Issue.51
    • Chen, D.Z.1
  • 14
    • 0029232840 scopus 로고
    • Efficient geometric algorithms on the EREW-PRAM
    • D. Z. Chen, "Efficient geometric algorithms on the EREW-PRAM," IEEE Trans. Parallel and Distributed Systems, 6 (1) (1995), pp. 41-47.
    • (1995) IEEE Trans. Parallel and Distributed Systems , vol.6 , Issue.1 , pp. 41-47
    • Chen, D.Z.1
  • 15
    • 2842590587 scopus 로고
    • An optimal parallel algorithm for detecting weak visibility of a simple polygon
    • D. Z. Chen, "An optimal parallel algorithm for detecting weak visibility of a simple polygon," International J. of Computational Geometry and Applications, 5 (1 & 2) (1995), pp. 93-124.
    • (1995) International J. of Computational Geometry and Applications , vol.5 , Issue.1-2 , pp. 93-124
    • Chen, D.Z.1
  • 16
    • 0030367229 scopus 로고    scopus 로고
    • Optimally computing the shortest weakly visible subedge for a simple polygon
    • D. Z. Chen, "Optimally computing the shortest weakly visible subedge for a simple polygon," J. of Algorithms, 20 (3) (1996), pp. 459-478.
    • (1996) J. of Algorithms , vol.20 , Issue.3 , pp. 459-478
    • Chen, D.Z.1
  • 17
    • 0346928754 scopus 로고
    • On the cruising guard problems
    • Institute of Information Science, Academia Sinica, Taipei, Taiwan
    • Y. T. Ching, M. T. Ko, and H. Y. Tu, "On the cruising guard problems," Technical Report, 1989, Institute of Information Science, Academia Sinica, Taipei, Taiwan.
    • (1989) Technical Report
    • Ching, Y.T.1    Ko, M.T.2    Tu, H.Y.3
  • 19
    • 0028092565 scopus 로고
    • Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
    • G. Das and G. Narasimhan, "Optimal linear-time algorithm for the shortest illuminating line segment in a polygon," Proc. 10th Annual ACM Symp. Computational Geometry, 1994, pp. 259-266.
    • (1994) Proc. 10th Annual ACM Symp. Computational Geometry , pp. 259-266
    • Das, G.1    Narasimhan, G.2
  • 21
    • 2842544002 scopus 로고
    • Parallel algorithms for shortest path problems in polygons
    • H. ElGindy and M. T. Goodrich, "Parallel algorithms for shortest path problems in polygons," The Visual Computer, 3 (6) (1988), pp. 371-378.
    • (1988) The Visual Computer , vol.3 , Issue.6 , pp. 371-378
    • Elgindy, H.1    Goodrich, M.T.2
  • 23
    • 0345496339 scopus 로고
    • Finding the convex hull of a sorted point set in parallel
    • M. T. Goodrich, "Finding the convex hull of a sorted point set in parallel," Information Processing Letters, 26 (1987/88), pp. 173-179.
    • (1987) Information Processing Letters , vol.26 , pp. 173-179
    • Goodrich, M.T.1
  • 24
    • 38249004992 scopus 로고
    • Triangulating a polygon in parallel
    • M. T. Goodrich, "Triangulating a polygon in parallel," J. of Algorithms, 10 (1989), pp. 327-351.
    • (1989) J. of Algorithms , vol.10 , pp. 327-351
    • Goodrich, M.T.1
  • 26
    • 2842565150 scopus 로고
    • Parallel methods for visibility and shortest path problems in simple polygons
    • M. T. Goodrich, S. B. Shauck, and S. Guha, "Parallel methods for visibility and shortest path problems in simple polygons," Algorithmica, 8 (1992), pp. 461-486.
    • (1992) Algorithmica , vol.8 , pp. 461-486
    • Goodrich, M.T.1    Shauck, S.B.2    Guha, S.3
  • 27
    • 0023247608 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), pp. 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
  • 34
    • 84976772007 scopus 로고
    • Parallel prefix computation
    • R. E. Ladner and M. J. Fischer, "Parallel prefix computation," J. of the ACM, 27 (4) (1980), pp. 831-838.
    • (1980) J. of the ACM , vol.27 , Issue.4 , pp. 831-838
    • Ladner, R.E.1    Fischer, M.J.2
  • 36
    • 0018491127 scopus 로고
    • An optimal algorithm for finding the kernel of a polygon
    • D. T. Lee and F. P. Preparata, "An optimal algorithm for finding the kernel of a polygon," J. of the ACM, 26 (1979), pp. 415-121.
    • (1979) J. of the ACM , vol.26 , pp. 415-1121
    • Lee, D.T.1    Preparata, F.P.2
  • 39
    • 0025508881 scopus 로고
    • An optimal algorithm for detecting weak visibility of a polygon
    • J.-R. Sack and S. Suri, "An optimal algorithm for detecting weak visibility of a polygon," IEEE Trans. Computers, C-39 (10) (1990), pp. 1213-1219.
    • (1990) IEEE Trans. Computers , vol.C-39 , Issue.10 , pp. 1213-1219
    • Sack, J.-R.1    Suri, S.2
  • 40
    • 0022872173 scopus 로고
    • A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
    • G. T. Toussaint, "A linear-time algorithm for solving the strong hidden-line problem in a simple polygon," Pattern Recognition letters, 4 (1986), pp. 449-451.
    • (1986) Pattern Recognition Letters , vol.4 , pp. 449-451
    • Toussaint, G.T.1
  • 41
    • 0020045441 scopus 로고
    • On a convex hull algorithm for polygons and its applications to triangulation problems
    • G. T. Toussaint and D. Avis, "On a convex hull algorithm for polygons and its applications to triangulation problems," Pattern Recognition, 15 (1) (1982), pp. 23-29.
    • (1982) Pattern Recognition , vol.15 , Issue.1 , pp. 23-29
    • Toussaint, G.T.1    Avis, D.2
  • 42
    • 2842541806 scopus 로고
    • Finding the minimum visible vertex distance between two nonintersecting simple polygons
    • G. A. Wang and E. P. F. Chan, "Finding the minimum visible vertex distance between two nonintersecting simple polygons," Proc. 2nd Annual ACM Symp. Computational Geometry, 1986, pp. 34-42.
    • (1986) Proc. 2nd Annual ACM Symp. Computational Geometry , pp. 34-42
    • Wang, G.A.1    Chan, E.P.F.2
  • 43
    • 0023826478 scopus 로고
    • Parallel triangulation of a polygon in two calls to the trapezoidal map
    • C. K. Yap, "Parallel triangulation of a polygon in two calls to the trapezoidal map," Algorithmica, 3 (1988), pp. 279-288.
    • (1988) Algorithmica , vol.3 , pp. 279-288
    • Yap, C.K.1


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