UP - logo
Library of Technical Faculties, Maribor (KTFMB)
  • Vsebnostni test za mnogokotnike s krožnimi loki
    Gomboši, Matej
    The paper describes an algorithm, which determines if a point is inside a polygon consisting of straight-line segment and also from circular arcs. The algorithm uses the ray intersection method and ... works in two steps. In the first step, only the straight-line segments are tested for containment. This gives us a partial result. In the second part of the algorithm, all circular arcs are processed with simple tests, which quickly answer our question. By the use of efficient data structure, this task can be done safely and easily. Used method enable the algorithm to achieve O(n) time complexity.
    Source: Zbornik desete Elektrotehniške in računalniške konference ERK 2001, 24. - 26. september 2001, Portorož, Slovenija (Zv. B, str. 231-234)
    Type of material - conference contribution
    Publish date - 2001
    Language - slovenian
    COBISS.SI-ID - 6545942

Shelf entry