UNI-MB - logo
UMNIK - logo
 
National and University Library, 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
  • An efficient simple polygon triangulation algorithm based on a uniform plane subdivision
    Lamot, Marko ; Žalik, Borut
    A new algorithm for triangulating simple polygons is proposed. The algorithm uses a uniform space subdivision to speed-up the triangulation. The algorithm efficiently combines two approaches: an ... ear-cutting and a diagonal insertion. Comparison with the popular polygon triangulation algorithms (Sloan's ear-cutting algorithm, Seidel's randomized incremental algorithm, algorithm based on Graham scan, and Garey's et al plane-sweep algorithm) for different classes of simple polygons (general, convex, monotone, star-shaped, and the polygons taken from a GIS database) is presented. For general polygons and GIS polygons, the proposed algorithm is the most efficient among the tested algorithms.
    Type of material - treatise, study
    Publication and manufacture - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2002
    Language - english
    COBISS.SI-ID - 13068822

Call number – location, accession no. ... Copy status
glavno skladišče 609644/2002 see publication
loading ...
loading ...
loading ...