Results 71 to 80 of about 346,915 (178)
Vesicle computers: Approximating a Voronoi diagram using Voronoi automata
, 2011 Irregular arrangements of vesicles filled with excitable and precipitating chemical systems are imitated by Voronoi automata - finite-state machines defined on a planar Voronoi diagram.
Holley, Julian +9 more
core +1 more source
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms
Journal of Computational Geometry, 2020 We study algorithms and combinatorial complexity bounds for stable-matching Voronoi diagrams, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$ such that (i) the ...
Gill Barequet +3 more
doaj +1 more source
Otimização de sistemas de atendimento emergenciais utilizando a teoria das filas e diagrama de voronoi ponderado [PDF]
, 2007 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-graduação em Engenharia de ProduçãoEste trabalho trata do problema de localização ótima de Estações de Emergência, localizadas no Corpo de Bombeiros, em que é ...
Contri, Rozelaine de Fatima Franzin
core
IEEE Access, 2019 This paper presents distributed algorithms for the coordination of a multi-agent network to minimize a prescribed cost function. The problem is studied for both cases of an environment without obstacles and an environment with fixed obstacles.
Hamid Mahboubi +3 more
doaj +1 more source
Brute-Force Voronoi Diagram Algorithm
, 2012 Brute-Force Voronoi Diagram ...
Maydwell, Lyndon
core +1 more source
Queries with segments in Voronoi diagrams
Computational Geometry, 2000 In this paper we consider proximity problems in which the queries are line segments in the plane. We build a query structure that for a set of n points P can determine the closest point in P to a query segment outside the convex hull of P in O(log) time.
Sergei Bespamyatnikh, Jack Snoeyink
openaire +4 more sources
On the facility location problem: One-round weighted Voronoi game
پژوهشهای ریاضی, 2020 Paper pages (47-56) Introduction The Voronoi game is a simple geometric model for competitive facility location problem which is played by two players, White and Black, in a continuous space (one-dimensional or two-dimensional).
Zeinab Hassani1, Marzieh Eskandari
doaj
A Generic Statistics-Based Tessellation Method of Voronoi Diagram
, 2015 In terms of distance function and spatial continuity in Voronoi diagram, a generic generating method of Voronoi diagram, named statistical Voronoi diagram, is proposed in this paper based upon statistics with mean vector and covariance matrix.
Shun Kang
core +1 more source
Time-based Voronoi Diagram and Transportation Network Pricing
, 2007 本論文主要有兩章，探討兩個不同的問題。這兩個問題都是與直線公路有關。 第二章我們考慮一個 Voronoi diagram 的變形，稱為「時間 Voronoi diagram」。在平面上有一組點 (site) 和一組直線公路，在公路上移動速度較快。兩點之間的「最短時間距離」則是從一點到另一點，所需要的最少時間。每條公路的速度亦不盡相同。我們將探討，在有公路的考量下，Voronoi diagram 會如何改變。 第三章我們考慮一個 Stackelberg game 的問題。一家運輸公司 ...
王維邦, Wang, Wei-Bung
core
Capturing intruders based on Voronoi diagrams assisted by information networks
International Journal of Advanced Robotic Systems, 2017 We consider a scenario of deploying multiple robots to capture all intruders in a cluttered workspace with many obstacles. Here, we say that a robot captures an intruder in the case where the intruder is within the maximum range of a weapon on the robot.
Jonghoek Kim
doaj +1 more source