Manuel Abellanas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Manuel Abellanas has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Leslie Bajuelos
Universidade de Aveiro
3 shared publications - Carlos Gregorio Hernández Díaz-Ambrona
AgSystems, Ceigram, itdUPM, Universidad Politécnica de Madrid (UPM)
2 shared publications I. Matos
Univ Aveiro, Dept Matemat, Aveiro, Portugal
2 shared publications- Inês Matos
Universidade de Aveiro
2 shared publications A. Bajuelos
Universidade de Aveiro
1 shared publicationB. Palop
Universidad de Valladolid
1 shared publication
Latest Publications
- Open Access
- 14 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.
- 14 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
Open AccessOptimal 2-Coverage of a Polygonal Region in a Sensor Network
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.
- 4 September 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 161 (6) , 909-918
The embracing Voronoi diagram and closest embracing number
- 4 September 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 161 (6) , 909-918
The embracing Voronoi diagram and closest embracing number
- 15 June 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (13) , 719-721
An “Art Gallery Theorem” for pyramids
- 15 June 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (13) , 719-721
An “Art Gallery Theorem” for pyramids
- 1 June 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (14) , 768-773
2-Covered paths by a set of antennas with minimum power transmission range
- 1 June 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (14) , 768-773
2-Covered paths by a set of antennas with minimum power transmission range
- Open Access
Good Illumination of Minimum Range
A point p is 1-well illuminated by a set F of n point lights if p lies in the interior of the convex hull of F. This concept corresponds to triangle-guarding or well-covering. In this paper we consider the illumination range of the light sources as a parameter to be optimized. First, we solve the problem of minimizing the light sources' illumination range to 1-well illuminate a given point p. We also compute a minimal set of light sources that 1-well illuminates p with minimum illumination range. Second, we solve the problem of minimizing the light sources' illumination range to 1-well illuminate all the points of a line segment with an O(n^2) algorithm. Finally, we give an O(n^2 log n) algorithm for preprocessing the data so that one can obtain the illumination range needed to 1-well illuminate a point of a line segment in O(log n) time. These results can be applied to solve problems of 1-well illuminating a trajectory by approaching it to a polygonal path.
Open AccessGood Illumination of Minimum Range
A point p is 1-well illuminated by a set F of n point lights if p lies in the interior of the convex hull of F. This concept corresponds to triangle-guarding or well-covering. In this paper we consider the illumination range of the light sources as a parameter to be optimized. First, we solve the problem of minimizing the light sources' illumination range to 1-well illuminate a given point p. We also compute a minimal set of light sources that 1-well illuminates p with minimum illumination range. Second, we solve the problem of minimizing the light sources' illumination range to 1-well illuminate all the points of a line segment with an O(n^2) algorithm. Finally, we give an O(n^2 log n) algorithm for preprocessing the data so that one can obtain the illumination range needed to 1-well illuminate a point of a line segment in O(log n) time. These results can be applied to solve problems of 1-well illuminating a trajectory by approaching it to a polygonal path.
- Open Access
Point set stratification and Delaunay depth
In the study of depth functions it is important to decide whether we want such a function to be sensitive to multimodality or not. In this paper we analyze the Delaunay depth function, which is sensitive to multimodality and compare this depth with others, as convex depth and location depth. We study the stratification that Delaunay depth induces in the point set (layers) and in the whole plane (levels), and we develop an algorithm for computing the Delaunay depth contours, associated to a point set in the plane, with running time O(n log^2 n). The depth of a query point p with respect to a data set S in the plane is the depth of p in the union of S and p. When S and p are given in the input the Delaunay depth can be computed in O(n log n), and we prove that this value is optimal.
Open AccessPoint set stratification and Delaunay depth
In the study of depth functions it is important to decide whether we want such a function to be sensitive to multimodality or not. In this paper we analyze the Delaunay depth function, which is sensitive to multimodality and compare this depth with others, as convex depth and location depth. We study the stratification that Delaunay depth induces in the point set (layers) and in the whole plane (levels), and we develop an algorithm for computing the Delaunay depth contours, associated to a point set in the plane, with running time O(n log^2 n). The depth of a query point p with respect to a data set S in the plane is the depth of p in the union of S and p. When S and p are given in the input the Delaunay depth can be computed in O(n log n), and we prove that this value is optimal.