메뉴 건너뛰기




Volumn 13, Issue 2, 2003, Pages 173-187

Planar strong visibility

Author keywords

Convexity; Generalized visibility; Restricted orientations

Indexed keywords


EID: 0037691508     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001116     Document Type: Article
Times cited : (2)

References (28)
  • 2
    • 0030192694 scopus 로고    scopus 로고
    • Fundamentals of restricted-orientation convexity
    • Eugene Fink and Derick Wood. Fundamentals of restricted-orientation convexity. Information Sciences, 92:175-196, 1997.
    • (1997) Information Sciences , vol.92 , pp. 175-196
    • Fink, E.1    Wood, D.2
  • 3
    • 54649084365 scopus 로고    scopus 로고
    • Generalized halfspaces in restricted-orientation convexity
    • Eugene Fink and Derick Wood. Generalized halfspaces in restricted-orientation convexity. Journal of Geometry, 62:99-120, 1998.
    • (1998) Journal of Geometry , vol.62 , pp. 99-120
    • Fink, E.1    Wood, D.2
  • 4
    • 0038798747 scopus 로고    scopus 로고
    • Strong restricted-orientation convexity
    • Eugene Fink and Derick Wood. Strong restricted-orientation convexity. Geometriae Dedicata, 69:35-51, 1998.
    • (1998) Geometriae Dedicata , vol.69 , pp. 35-51
    • Fink, E.1    Wood, D.2
  • 5
    • 49649136358 scopus 로고
    • An efficient algorithm for determining the convex hull of a finite planar set
    • Ronald L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132-133, 1972.
    • (1972) Information Processing Letters , vol.1 , pp. 132-133
    • Graham, R.L.1
  • 9
    • 0021729499 scopus 로고
    • Dynamic C-oriented polygonal intersection searching
    • Ralf Hartmut Güting. Dynamic C-oriented polygonal intersection searching. Information and Control, 63:143-163, 1984.
    • (1984) Information and Control , vol.63 , pp. 143-163
    • Güting, R.H.1
  • 10
    • 85012710243 scopus 로고
    • Display of visible edges of a set of convex polygons
    • Godfried T. Toussaint, editor, North-Holland Publishing Co., Amsterdam, Netherlands
    • Der-Tsai Lee and I. M. Chen. Display of visible edges of a set of convex polygons. In Godfried T. Toussaint, editor, Computational Geometry, pages 249-265. North-Holland Publishing Co., Amsterdam, Netherlands, 1985.
    • (1985) Computational Geometry , pp. 249-265
    • Lee, D.-T.1    Chen, I.M.2
  • 11
    • 0018491127 scopus 로고
    • An optimal algorithm for finding the kernel of a polygon
    • Der-Tsai Lee and Franco P. Preparata. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26:415-421, 1979.
    • (1979) Journal of the ACM , vol.26 , pp. 415-421
    • Lee, D.-T.1    Preparata, F.P.2
  • 12
    • 0011606228 scopus 로고
    • A fast algorithm for testing for safety and detecting deadlock in locked transaction systems
    • Witold Lipski and Christos H. Papadimitriou. A fast algorithm for testing for safety and detecting deadlock in locked transaction systems. Journal of Algorithms, 2:211-226, 1981.
    • (1981) Journal of Algorithms , vol.2 , pp. 211-226
    • Lipski, W.1    Papadimitriou, C.H.2
  • 14
    • 0018739525 scopus 로고
    • A linear algorithm for finding the convex hull of a simple polygon
    • Duncan McCallum and David Avis. A linear algorithm for finding the convex hull of a simple polygon. Information Processing Letters, 9:201-206, 1979.
    • (1979) Information Processing Letters , vol.9 , pp. 201-206
    • McCallum, D.1    Avis, D.2
  • 17
    • 0021000355 scopus 로고
    • Constructing the X-Y convex hull of a set of X-Y polygons
    • Tina M. Nicholl, Der-Tsai Lee, Y. Z. Liao, and Chak-Kuen Wong. Constructing the X-Y convex hull of a set of X-Y polygons. BIT, 23:456-471, 1983.
    • (1983) BIT , vol.23 , pp. 456-471
    • Nicholl, T.M.1    Lee, D.-T.2    Liao, Y.Z.3    Wong, C.-K.4
  • 18
    • 0021483690 scopus 로고
    • On the definition and computation of rectilinear convex hulls
    • Thomas Ottmann, Eljas Soisalon-Soininen, and Derick Wood. On the definition and computation of rectilinear convex hulls. Information Sciences, 33:157-171, 1984.
    • (1984) Information Sciences , vol.33 , pp. 157-171
    • Ottmann, T.1    Soisalon-Soininen, E.2    Wood, D.3
  • 20
    • 0038460976 scopus 로고
    • PhD thesis, School of Computer Science, University of Waterloo, Technical Report cs-87-57
    • Gregory J. E. Rawlins. Explorations in Restricted-Orientation Geometry. PhD thesis, School of Computer Science, University of Waterloo, 1987. Technical Report cs-87-57.
    • (1987) Explorations in Restricted-Orientation Geometry
    • Rawlins, G.J.E.1
  • 21
    • 0038120831 scopus 로고
    • Convexity, visibility, and orthogonal polygons
    • Prabir Bhattacharya, Robert A. Melter, and Azriel Rosenfeld, editors, American Mathematical Society, Providence
    • Gregory J. E. Rawlins, Sven Schuierer, and Derick Wood. Convexity, visibility, and orthogonal polygons. In Prabir Bhattacharya, Robert A. Melter, and Azriel Rosenfeld, editors, Vision Geometry, Contemporary Mathematics 119, pages 225-237. American Mathematical Society, Providence, RI, 1991.
    • (1991) Vision Geometry, Contemporary Mathematics , vol.119 , pp. 225-237
    • Rawlins, G.J.E.1    Schuierer, S.2    Wood, D.3
  • 22
    • 0023295480 scopus 로고
    • Optimal computation of finitely oriented convex hulls
    • Gregory J. E. Rawlins and Derick Wood. Optimal computation of finitely oriented convex hulls. Information and Computation, 72:150-166, 1987.
    • (1987) Information and Computation , vol.72 , pp. 150-166
    • Rawlins, G.J.E.1    Wood, D.2
  • 23
    • 85023387638 scopus 로고
    • Ortho-convexity and its generalizations
    • Godfried T. Toussaint, editor, Elsevier Science Publishers B. V., North-Holland, Amsterdam, Netherlands
    • Gregory J. E. Rawlins and Derick Wood. Ortho-convexity and its generalizations. In Godfried T. Toussaint, editor, Computational Morphology, pages 137-152. Elsevier Science Publishers B. V., North-Holland, Amsterdam, Netherlands, 1988.
    • (1988) Computational Morphology , pp. 137-152
    • Rawlins, G.J.E.1    Wood, D.2
  • 24
    • 0025634734 scopus 로고
    • Restricted-orientation convex sets
    • Gregory J. E. Rawlins and Derick Wood. Restricted-orientation convex sets. Information Sciences, 54:263-281, 1991.
    • (1991) Information Sciences , vol.54 , pp. 263-281
    • Rawlins, G.J.E.1    Wood, D.2
  • 25
    • 0038798749 scopus 로고
    • PhD thesis, Institut für Informatik, Universität Freiburg
    • Sven Schuierer. On Generalized Visibility. PhD thesis, Institut für Informatik, Universität Freiburg, 1991.
    • (1991) On Generalized Visibility
    • Schuierer, S.1
  • 26
    • 0038120830 scopus 로고
    • Optimal algorithms to compute the closure of a set of iso-rectangles
    • Eljas Soisalon-Soininen and Derick Wood. Optimal algorithms to compute the closure of a set of iso-rectangles. Journal of Algorithms, 5:199-214, 1984.
    • (1984) Journal of Algorithms , vol.5 , pp. 199-214
    • Soisalon-Soininen, E.1    Wood, D.2
  • 28
    • 0023399869 scopus 로고
    • On some distance problems in fixed orientations
    • Peter Widmayer, Ying-Fung Wu, and Chak-Kuen Wong. On some distance problems in fixed orientations. SIAM Journal on Computing, 16:728-746, 1987.
    • (1987) SIAM Journal on Computing , vol.16 , pp. 728-746
    • Widmayer, P.1    Wu, Y.-F.2    Wong, C.-K.3


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