메뉴 건너뛰기




Volumn 16, Issue 2, 2013, Pages 130-138

An algorithm for generating geometric buffers for vector feature layers

Author keywords

Algorithm; Geometric buffer; Spatial analysis

Indexed keywords

ALGORITHMS; DISSOLUTION; VECTORS;

EID: 84881006339     PISSN: 10095020     EISSN: None     Source Type: Journal    
DOI: 10.1080/10095020.2012.747643     Document Type: Article
Times cited : (19)

References (7)
  • 3
    • 0037290867 scopus 로고    scopus 로고
    • Construction of a Non-Symmetric Geometric Buffer From a Set of Line Segments
    • Zalik, B.; Zadravec, M.; Clapworthy, G. Construction of a Non-Symmetric Geometric Buffer From a Set of Line Segments. Comput. Geosci. 2003, 29, 53-63.
    • (2003) Comput. Geosci. , vol.29 , pp. 53-63
    • Zalik, B.1    Zadravec, M.2    Clapworthy, G.3
  • 6
    • 0030850247 scopus 로고    scopus 로고
    • On the Complexity of Point in Polygon Algorithm
    • Chong-Wei, Huang.; Tian-Yuan, Shih. On the Complexity of Point in Polygon Algorithm. Comput. Geosci. 1997, 23 (1), 109-118.
    • (1997) Comput. Geosci , vol.23 , Issue.1 , pp. 109-118
    • Chong-Wei, H.1    Tian-Yuan, S.2
  • 7
    • 73749087578 scopus 로고    scopus 로고
    • A Point in Polygon Method Based on a Quasi Closest Point
    • Yang, Sheng.; Yong, Jun-Hai; Sun, Jiaguang; Gu, Hejin; Paul, Jean-Claude. A Point in Polygon Method Based on a Quasi Closest Point. Comput. Geosci. 2010, 36 (2010), 205-213.
    • (2010) Comput. Geosci. , vol.36 , Issue.2010 , pp. 205-213
    • Yang, S.1    Yong, J.-H.2    Sun, J.3    Gu, H.4    Paul, J.-C.5


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