Results 81 to 90 of about 26,725 (220)
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
, 2007 We give lower bounds for the combinatorial complexity of the Voronoi diagram of polygonal curves under the discrete Frechet distance. We show that the Voronoi diagram of n curves in R^d with k vertices each, has complexity Omega(n^{dk}) for dimension d=1,
Buchin, Kevin, Buchin, Maike
core +1 more source
On the Complexity of Randomly Weighted Voronoi Diagrams
, 2014 In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or other more ...
Har-Peled, Sariel, Raichel, Benjamin
core +1 more source
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barequet, Gill +2 more
openaire +1 more source
FluidMap: Proportional and Spatially Consistent Layout Enrichments in Multidimensional Projections
Computer Graphics Forum, EarlyView.FluidMap faithfully represents the frequency of an attribute and preserves spatial consistency. Current space‐filling methods over‐ or under‐represent attribute categories (i.e., all Voronoi‐based methods), sacrifice spatial consistency (i.e., Nmap) or both (i.e., Voronoi‐MWα).
Daniela Blumberg +5 more
wiley +1 more source
A Survey of Methods for Constructing 3D Urban Models From Point Clouds
Computer Graphics Forum, EarlyView.The survey outlines a general process for constructing 3D models from point clouds and categorizes the methods based on their use of templates, basic surface primitives, hybrid approaches, or linear primitives. Additionally, the survey reviews the datasets and benchmarks that are essential for testing and training the developed methods.
Chiara Romanengo +5 more
wiley +1 more source
A reconfigurable hybrid intelligent system for robot navigation [PDF]
, 2011 Soft computing has come of age to o er us a wide array of powerful and e cient algorithms that independently matured and in uenced our approach to solving problems in robotics, search and optimisation.
Barczak, A.L.C. +3 more
core
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
International Transactions in Operational Research, EarlyView.Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar +2 more
wiley +1 more source
ISPRS International Journal of Geo-Information, 2015 Vehicle routing optimization (VRO) designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard) complexity, many VROs involved in real-world applications require too much ...
Wei Tu +3 more
doaj +1 more source
New Monte Carlo method for planar Poisson-Voronoi cells
, 2006 By a new Monte Carlo algorithm we evaluate the sidedness probability p_n of a planar Poisson-Voronoi cell in the range 3 \leq n \leq 1600. The algorithm is developed on the basis of earlier theoretical work; it exploits, in particular, the known ...
Brakke K A +11 more
core +3 more sources