Buscar
Mostrando ítems 41-50 de 61
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Connectivity and stochastic robustness of synchronized multi-drone systems
(Elsevier, 2024-05-31)
A set of n drones with limited communication range is deployed to monitor a terrain partitioned into pairwise disjoint and closed convex trajectories, one per drone. There is exactly one communication link between two ...
Tesis Doctoral
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Flamenco music information retrieval.
(2018-10-31)
El flamenco, un género musical centrado en la improvisación y la espontaneidad, tiene su origen en el sur de España y atrae a una creciente comunidad de aficionados de países de todo el mundo. El aumento constante y la ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Drawing the double circle on a grid of minimum size
(2013)
In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed such a drawing in the grid [1, c ·n 3/2]2 for some constant c > 0, and showed that this grid size ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Note on the number of obtuse angles in point sets
(2013)
In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines at least n3/18−O(n2) obtuse angles and also presented a special set of nn points to show the upper ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Separability, Boxicity, and Partial Orders
(Springer, 2023)
A collection S = {Si,..., Sn} of disjoint closed convex sets in Rd is separable if there exists a direction (a non-zero vector) −→v of Rd such that the elements of S can be removed, one at a time, by translating them an ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Guarding the vertices of thin orthogonal polygons is NP-hard
(2013)
An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards its interior until they hit the boundary is a tree. We show that the problem of computing a minimum ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Distance domination, guarding and vertex cover for maximal outerplanar graphs
(2013)
In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and distance vertex cover concepts on triangulation graphs. Furthermore, for any n-vertex maximal ...
Tesis Doctoral
Libro
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Las fronteras entre los géneros. Flamenco y otras músicas de tradición oral
(Universidad de Sevilla, 2012)
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
(2013)
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric ...