DIKUL - logo
Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • A new approach for vertex guarding of polyhedral surfaces
    Kaučič, Branko ; Žalik, Borut
    Guarding polyhedral surfaces is an important optimisation problem with many applications. In the contribution, the problem of finding the minimum number of guards and their positions, which cover a ... convex terrain is considered. Known approximative algorithms (Greedy Add, Stingy Drop, and the algorithm based on 5-coloring) are revised and a new approach names Smart Greedy algorithm is given. The algorithm works in three steps: identification of the vertex that is almost sure not a part of the optimum solution, selection of the vertex that is almost sure a part of the optimum solution, and updating a corresponding data structure. The proposed algorithm is compared against optimality of solutions and spent running time. It is shown that our algorithm produces best results in the shortest time.
    Vrsta gradiva - elaborat, študija ; neleposlovje za odrasle
    Založništvo in izdelava - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2002
    Jezik - angleški
    COBISS.SI-ID - 13069334

Signatura – lokacija, inventarna št. ... Status izvoda
glavno skladišče 609644/2002 gl. publikacijo
loading ...
loading ...
loading ...