Um estudo do diagrama de Voronoi para dois pontos geradores específicos com um obstáculo circular

• Ano de defesa: 2020
• Autor(a) principal: Lima, Rafael Pereira de
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal da Paraíba; Brasil; Informática; Programa de Pós-Graduação em Modelagem Matemática e computacional; UFPB
• Palavras-chave em Português: Diagrama de Voronoi; Métrica e grafo de visibilidade; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: https://repositorio.ufpb.br/jspui/handle/123456789/23008

In this work, we study concepts related to the Voronoi diagram, an important geometric data structure for solving proximity problems. Its construction takes place by comparing points arranged in a certain space and specific points, called the sites or generating points. Points that are the same distance from two neighboring sites make up the border of the diagram. There are algorithms that allow to build this diagram when polygonal obstacles are inserted between the sites. However, these algorithms are not useful when these obstacles have other formats. In this sense, we propose a computational algorithm to determine the boundary of the Voronoi diagram when there is a circular obstacle between two generating points arranged in the flat space R2.