6 research outputs found

    Cover contact graphs

    Get PDF
    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 the contact graph of a cover a cover contact graph (CCG). We are interested in three types of tasks, both in the general case and in the special case of seeds on a line: (a) deciding whether a given seed set has a connected CCG, (b) deciding whether a given graph has a realization as a CCG on a given seed set, and (c) bounding the sizes of certain classes of CCG’s. Concerning (a) we give efficient algorithms for the case that seeds are points and show that the problem becomes hard if seeds and covers are disks. Concerning (b) we show that this problem is hard even for point seeds and disk covers (given a fixed correspondence between graph vertices and seeds). Concerning (c) we obtain upper and lower bounds on the number of CCG’s for point seeds

    Cover Contact Graphs

    Get PDF
    Es una ponencia presentada al 15th International Symposium on Graph Drawing (2007)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 contact graph of a cover a cover contact graph (CCG). We are interested in two types of tasks: (a) deciding whether a given seed set has a connected CCG, and (b) deciding whether a given graph has a realization as a CCG on a given seed set. Concerning task (a) we give efficient algorithms for the case that seeds are points and covers are disks or triangles. We show that the problem becomes NP-hard if seeds and covers are disks. Concerning task (b) we show that it is even NP-hard for point seeds and disk covers (given a fixed correspondence between vertices and seeds).German Research Foundation WO 758/4-

    Marco activo de recursos de innovación docente: Madrid

    Get PDF
    Una guía de espacios e instituciones para actividades educativas complementarias en enseñanza secundaria y Formación Profesional

    La Familia: Videoclip creativo

    No full text
    Universidad de Sevilla. Grado en Comunicación Audiovisua

    La ciudad de las mujeres

    No full text
    Blog del proyecto: http://ciudaddelasmujeres.blogspot.comEl trabajo obtuvo un Premio Tomás García Verdejo a las buenas prácticas educativas en la Comunidad Autónoma de Extremadura para el curso 2017/2018. Modalidad BSe presenta un proyecto llevado a cabo durante el curso académico 2017/2018 en el IES Albalat (Navalmoral de la Mata, Cáceres) que pretendía la promoción de la igualdad efectiva entre mujeres y hombres mediante su integración en la enseñanza. Las actividades llevadas a cabo tenían los siguientes objetivos específicos: promover la educación inclusiva, profundizar en la educación en valores democráticos y de convivencia ciudadana que contribuyan a la implicación social del alumnado, propiciar el desarrollo de pedagogías activas como la enseñanza interdisciplinar y los métodos colaborativos que favorezcan a la reflexión docente y la coordinación pedagógica, fomentar estrategias metodológicas que permitan el uso de competencia clave mediante la interrelación de ámbitos del conocimiento y hacer reflexionar a la comunidad educativa sobre la necesidad de dar visibilidad a las mujeresExtremaduraES
    corecore