SciELO - Scientific Electronic Library Online

 
vol.4 issue2Virtual Education based in Competences author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

    Related links

    • Have no cited articlesCited by SciELO
    • Have no similar articlesSimilars in SciELO

    Bookmark

    Revista Investigación y Tecnología

    Print version ISSN 2306-0522

    Abstract

    TORRICO, Lucio. Fortune 's algorithm without circle events using InCircle primitive. Rev Inv Tec [online]. 2016, vol.4, n.2, pp. 01-15. ISSN 2306-0522.

    To find the Voronoi diagram (also called Dirich let tessellation or Thiessen polygons) from a set of points in the plane, Fortune 's algorithm use the empty-circle property around the vertices in an implicit way. All presentations of this algorithm use circle-events without explicit calculations of the primitive InCircle. Our goal is to find out if there is an alternate version of Fortune 's algorithm without circle-events, using exhaustively the primitive InCircle. We have designed this variant of the algorithm, argued their bases and, in addition to the presentation, include an execution example that allows clarify their use.

    Keywords : Fortune 's algorithm; InCircle primitive; Voronoi diagram.

            · abstract in spanish     · text in spanish     · pdf in spanish