izpis_h1_title_alt

Rezanje poligonov
ID Komić, Armin (Author), ID Žabkar, Jure (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (514,42 KB)
MD5: 5B24EF45DF287D4C318C1C9DB2AC0BC7

Abstract
Rezanje poligonov lahko poleg uporabe v računalniški grafiki pride prav tudi na drugih področjih. Praktičen primer uporabe in motivacija za pričujoče delo je načrtovanje cest, kjer na zemljevid vrišemo želeno traso ceste, nato pa različno velika vozila predstavimo s pravokotniki in simuliramo njihovo vožnjo po začrtani trasi. Zaporedje pravokotnikov, ki ga tako dobimo, je množica prekrivajočih se poligonov. Če želimo pri takem načrtovanju dobiti natančen rezultat, je za izris enega dela ceste potrebno združiti veliko število poligonov. Da bi rešili ta problem, potrebujemo hiter in zanesljiv algoritem. Za uporabo v tem in v podobnih primerih je potrebno poskrbeti, da lahko algoritem izvaja izračune nad poligoni poljubnih oblik, ki so predstavljeni z množicami decimalnih koordinat.

Language:Slovenian
Keywords:poligon, segment, presečišče
Work type:Bachelor thesis/paper
Organization:FRI - Faculty of Computer and Information Science
Year:2019
PID:20.500.12556/RUL-109934 This link opens in a new window
COBISS.SI-ID:1538335683 This link opens in a new window
Publication date in RUL:10.09.2019
Views:2926
Downloads:166
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Polygon clipping
Abstract:
Polygon clipping apart from being used in computer graphics can also be used in other areas. A practical example of this is road construction planning, where we use a map to draw a road on and the program draws a vehicle-shaped polygon at each point. When all the polygons are combined, we get an outline of the road, which is appropriately shaped and wide enough in turns with respect to the diagonal length of the vehicle. In order to obtain an accurate result in such planning, a large number of polygons must be combined to draw one section of the road. To solve this problem, we need a fast and reliable algorithm. For use in this and similar cases, it is necessary to make sure that the algorithm calculations can work on polygons of arbitrary shapes represented by sets of decimal coordinates.

Keywords:polygon, segment, intersection

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back