GARRIDO VIZUETE , María De Los Angeles

El área de investigación sobre dibujos de grafos (graph drawing) se ha convertido en un campo extensamente estudiado, constituyendo una interesante conexión entre la computación y la teoría de grafos. Dentro de ella, la representación ortogonal de grafos ocupa un lugar importante por su aplicación al diseño de circuitos VLSI, dando lugar a ......

Los Problemas y Teoremas de Galería de Arte proporcionan resultados y métodos que permiten iluminar o vigilar galerías de arte de manera efectiva. En particular, se exponen los pasos a seguir para situar el número de guardianes necesarios que vigilan el interior de una galería de arte, modelizada por un polígono de n vértices, esto es, la parte...

This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we prove that testing whether a graph admits a rectilinear (without bends) embedding essentially equivalent to a given...

In this work we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative dif- ference between the colours of its vertices. These edge colours are ordered in lexicographical decreasing ordering and...

In this paper we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between the colours of its vertices. These edge colours are ordered in lexicographical decreasing ordering and...

In this paper,we present the notion of greyscale of a graph, as a colouring of its vertices that uses colours from the continuous spectrum [0, 1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between the colours of its vertices. These edge colours are ordered in lexicographical increasing order...

The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible orthogonal paths joining them, whether is it possible to choose a path for each pair avoiding all intersections. We prove that if each pair has one or two possible paths to join it, then the problem is solvable in quadratic time,...

Plan Andaluz de Investigación (Junta de Andalucía)

Junta de Andalucía

Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a problem that arises when labeling schematized maps, e.g. for subway networks. We present algorithms for labeling points on a line with axis-parallel rectangular labels of equal...

The functional service life of heritage buildings, defined as the time period during which the building fulfils the requirements for which it was designed, is a complex system that has still not been fully resolved and continues to be the object of research regarding its social, economic and cultural importance. This paper presents an...

This article discusses the usability of the Art-Risk 3.0 software for research on the conservation of heritage buildings. It is a new and free software based on fuzzy logic, which enables the assessment of preventive conservation and surveillance of the restoration of heritage buildings over a period of time. This artificial...

In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n2) time and space algorithm for solving the problem of reporting the set of segments of each...

eritage preservation poses numerous difficulties, especially in emergency situations or during bud get cuts. In these contexts, having tools that facilitate efficient and rapid management of hazards vulnerabilities is a priority for the preventive conservation and triage of cultural assets. This paper presents the first (to the authors'...

No description

In this paper, we analyze the adaptation to the Virtual Learning Environment of those subjects related to the knowledge area of Applied Mathematics, corresponding to the Technical Architecture Degree and Building Engineering, by indicating those aspects which can be improved.

Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We consider the problem of finding such a k-factor of S by using auxiliary points. Two types are considered: white points whose position is fixed, and Steiner points which have no fixed position. Our approach provides algorithms...

We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum and which color is free; and Steiner points whose position and color is free. We present bounds on the number of white...

We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, respectively, but they can touch. We call...

We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, but they can touch. We call the...