Return to search

Voronojaus diagramos ir jų taikymai / Voronoi diagrams and their applications

In these theses are pepresented the Voronoi diagram and Network Voronoi diagram. The shortest path Dijkstra’s algorithm was modified in this way that calculates shortest paths from several Voronoi generators at the same time. The first result - partition of the nodes of the network. The seond result - arcs of the network are attributed to the generators, considering especially their direction and asymmetric costs. Applications allow compare Network Voronoi diagrams to Voronoi diagrams. For this puspose we modified Fortune algorithm. We made particular product for Taxi depot. The user can make his own implementation.

Identiferoai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2005~D_20050603_092713-98814
Date03 June 2005
CreatorsŽvikaitė, Laura
ContributorsSirius, Vaclovas, Lankauskas, Afredas, Sakalauskas, Leonidas, Steuding, Rasa, Turskienė, Sigita, Kulvietis, Genadijus, Klimašauskienė, Birutė, Siauliai University
PublisherLithuanian Academic Libraries Network (LABT), Siauliai University
Source SetsLithuanian ETD submission system
LanguageLithuanian
Detected LanguageEnglish
TypeMaster thesis
Formatapplication/pdf
Sourcehttp://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050603_092713-98814
RightsUnrestricted

Page generated in 0.0017 seconds