Browsing by Subject "Voronoi polygons"
Now showing items 1-11 of 11
-
Caminos de desviación mínima local
(U. Zaragoza, 2009)
Conference report
Open AccessUn camino que conecta dos puntos s y t en el plano es de desviación mínima respecto de un conjunto de puntos S si la mayor de las distancias entre un punto del camino y S es la menor posible entre todos los caminos que ... -
Connecting Red Cells in a Bicolour Voronoi Diagram
(2012-11)
Article
Restricted access - publisher's policyLet S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper is to calculate the minimum value of the red sites’ weight such that the union of the red ... -
Diagramas de Voronoi de alcance limitado
(Universitat Politècnica de Catalunya, 2009-06-19)
Master thesis (pre-Bologna period)
Open Access -
DVALon: una herramienta para diagramas de Voronoi y grafos de proximidad de alcance limitado
(Prensas Universitarias de Zaragoza, 2009)
Conference report
Open AccessPresentamos un estudio de los diagramas de Voronoi de alcance limitado de un conjunto finito de puntos del plano y DVALon, una herramienta para la manipulaci´on de dichos diagramas, los grafos de proximidad de alcance ... -
Impact of mobile transmitter sources on radio frequency energy harvesting
(Universitat Politècnica de Catalunya, 2012-09-05)
Master thesis (pre-Bologna period)
Open Access
Covenantee: Northeastern University[ANGLÈS] Wireless energy harvesting sensors networks constitute a new paradigm, where the motes deployed in the field are no longer constrained by the limited battery resource, but are able to recharge themselves through ... -
Multi-Robot workspace division based on compact polygon decomposition
(Institute of Electrical and Electronics Engineers (IEEE), 2021)
Article
Open AccessIn this work, we tackle the problem of multi-robot convex workspace division. We present an algorithm to split a convex area among several robots into the corresponding number of parts based on the area requirements for ... -
On structural and graph theoretic properties of higher order Delaunay graphs
(2009-12)
Article
Open AccessGiven a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a graph with vertex set $\emph{P}$ and an edge exists between two points p,q ∊ $\emph{P}$ when there is a circle through ... -
Proximity graphs inside large weighted graphs
(2010)
Conference report
Open AccessGiven a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ... -
Simplified Voronoi diagrams for motion planning of quadratically-solvable Gough-Stewart platforms
(Springer, 2012)
Conference report
Open AccessThe obstacles in Configuration Space of quadratically-solvable Gough-Stewart platforms, due to both kinematic singularities and collisions, can be uniformly represented by a Boolean combination of signs of 4×4 determinants ... -
Stabbing circles for sets of segments in the plane
(2016)
Conference report
Restricted access - publisher's policyStabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ... -
Stabbing circles for sets of segments in the plane
(2017-03-13)
Article
Open AccessStabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ...
