메뉴 건너뛰기




Volumn 29, Issue 1, 2003, Pages 53-63

Construction of a non-symmetric geometric buffer from a set of line segments

Author keywords

Algorithms; Computational geometry; Geometric buffer; GIS

Indexed keywords

ALGORITHMS; GEOMETRY;

EID: 0037290867     PISSN: 00983004     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-3004(02)00076-6     Document Type: Article
Times cited : (26)

References (13)
  • 3
    • 0012063719 scopus 로고
    • Faster line segment intersection
    • Kirk, D. (Ed.), Academic Press, Boston
    • Franklin, A., 1992. Faster line segment intersection. In: Kirk, D. (Ed.), Graphics Gems III. Academic Press, Boston, pp. 199-202.
    • (1992) Graphics Gems III , pp. 199-202
    • Franklin, A.1
  • 4
    • 0030850247 scopus 로고    scopus 로고
    • On the complexity of pointin-polygon algorithms
    • Huang, C.-W., Shih, T.-Y., 1997. On the complexity of pointin-polygon algorithms. Computers & Geosciences 23 (1), 109-118.
    • (1997) Computers and Geosciences , vol.23 , Issue.1 , pp. 109-118
    • Huang, C.-W.1    Shih, T.-Y.2
  • 5
    • 0032676954 scopus 로고    scopus 로고
    • An overview of offset curves and surfaces
    • Maekawa, T., 1999. An overview of offset curves and surfaces. Computer Aided Design 31 (3), 165-173.
    • (1999) Computer Aided Design , vol.31 , Issue.3 , pp. 165-173
    • Maekawa, T.1
  • 10
    • 0032731121 scopus 로고    scopus 로고
    • A GIS based component-oriented integrated system for estimation, vizualisation and analysis of road traffic air pollution
    • Rebolj, D., Sturm, P.J., 1999. A GIS based component-oriented integrated system for estimation, vizualisation and analysis of road traffic air pollution. Environmental Modelling and Software 14 (6), 531-539.
    • (1999) Environmental Modelling and Software , vol.14 , Issue.6 , pp. 531-539
    • Rebolj, D.1    Sturm, P.J.2
  • 11
    • 0034098080 scopus 로고    scopus 로고
    • Two efficient algorithms for determining intersection points between simple polygons
    • $ Zalik, B., 2000. Two ef.cient algorithms for determining intersection points between simple polygons. Computers & Geosciences 26 (2), 137-151.
    • (2000) Computers and Geosciences , vol.26 , Issue.2 , pp. 137-151
    • Žalik, B.1
  • 12
    • 0032649061 scopus 로고    scopus 로고
    • A universal trapezoidation algorithm for planar polygons
    • $ Zalik, B., Clapworthy, G.J., 1999. A universal trapezoidation algorithm for planar polygons. Computers & Graphics 23 (3), 353-363.
    • (1999) Computers and Graphics , vol.23 , Issue.3 , pp. 353-363
    • Žalik, B.1    Clapworthy, G.J.2
  • 13
    • 0035546470 scopus 로고    scopus 로고
    • A cell-based point-in-polygon algorithm for large sets of points
    • $ Zalik, B., Kolingerova, I., 2001. A cell-based point-in-polygon algorithm for large sets of points. Computers & Geosciences 27 (10), 1135-1145.
    • (2001) Computers and Geosciences , vol.27 , Issue.10 , pp. 1135-1145
    • Žalik, B.1    Kolingerova, I.2


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