UNI-MB - logo
UMNIK - logo
 
(UM)
  • Hiter algoritem za presek ravninskih mnogokotnikov
    Gomboši, Matej ; Žalik, Borut
    The paper describes an algorithm which finds an intersection between any two well-defined polygons. The algorithm works in three steps. In the first step, the intersection points of the polyfon edges ... are calculated by the use of a sweep line. These points are needed in the second part of the algorithm where they are eqipped with so-called navigation data. In the last part of the algorithm, an intersection polygon is determined by performing a walk-about through polygon edges and intersection points. By the use of the developed data structure, this task can be done safely and quickly.
    Source: Zbornik osme Elektrotehniške in računalniške konference ERK '99, 23. - 25. september 1999, Portorož, Slovenija (Zv. B, str. 57-60)
    Type of material - conference contribution
    Publish date - 1999
    Language - slovenian
    COBISS.SI-ID - 4839446

Shelf entry