Akademska digitalna zbirka SLovenije - logo
(UM)
  • Construction of a non-symmetric geometric buffer from a set of line segments
    Žalik, Borut ; Zadravec, Mirko ; Clapworthy, Gordon J.
    The paper presents an algorithm for constructing the geometric outlines of a given set of line segments, using a sweep-line approach. The algorithm works in four steps: creating the basic geometric ... outlines, identifying the intersection points between them, constructing cycles, and determining the spatial relationships amongst the cycles. In the worst case, when each basic geometric buffer intersects all the other, the time complexity of the algorithm is O(n2 log n), where n is the number of input line segments. However, in practice, the expected time complexity is much lower, and this has been confirmed by experiments - it has been shown that O(n log n) time complexity is a good estimation in most situations. The algorithm has been used in GIS applications over a period and has proved to be successful.
    Vir: Computers & Geosciences. - ISSN 0098-3004 (Vol. 29, no. 1, 2003, str. 53-63)
    Vrsta gradiva - članek, sestavni del
    Leto - 2003
    Jezik - angleški
    COBISS.SI-ID - 7571990

vir: Computers & Geosciences. - ISSN 0098-3004 (Vol. 29, no. 1, 2003, str. 53-63)

loading ...
loading ...
loading ...

Vnos na polico