Perfil del autor: Grima Ruiz, Clara Isabel
Datos institucionales
Nombre | Grima Ruiz, Clara Isabel |
Departamento | Matemática Aplicada I |
Área de conocimiento | Matemática Aplicada |
Categoría profesional | Profesora Titular de Universidad |
Correo electrónico | Solicitar |
Estadísticas
-
Nº publicaciones
29
-
Nº visitas
4909
-
Nº descargas
4775
Publicaciones |
---|
Artículo
Claves del presente y futuro del ensayo
(Círculo de Bellas Artes de Madrid, 2023)
¿Qué debe reunir un ensayo para ser publicado? ¿Por qué títulos como El infinito en un junco arrasan? ¿Sobrevivirá el ... |
Artículo
A quantitative principle to understand 3D cellular connectivity in epithelial tubes
(Cell Systems, 2022)
Apico-basal cell intercalations (scutoids) optimize packing and energy expenditure in curved epithelia. Further consequences ... |
Artículo
Author Correction: Scutoids are a geometrical solution to three-dimensional packing of epithelia
(Nature Research, 2018)
|
Artículo
Scutoids are a geometrical solution to three-dimensional packing of epithelia
(Nature Publishing Group, 2018)
As animals develop, tissue bending contributes to shape the organs into complex three-dimensional structures. However, the ... |
Ponencia
Técnicas cuánticas para la evolución de grafos aleatorios
(Instituto de Matemáticas de la UNAM, 2015)
Con la idea de modelar el comportamiento de diversas redes sociales a lo largo del tiempo, mostramos algunos resultados ... |
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
(2014)
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ... |
Ponencia
Cuentos y cuentas para despertar la curiosidad
(THALES: Sociedad Andaluza de Educación Matemática, 2014)
Pese a la revolución científica y tecnológica de finales de siglo XX y comienzos del XXI, la enseñanza de las matemáticas ... |
Artículo
Reporting Bichromatic Segment Intersections from Point Sets
(2012)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets ... |
Artículo
Cover contact graphs
(2012)
We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by ... |
Artículo
Stabbers of line segments in the plane
(2011)
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner ... |
Capítulo de Libro
Compact Grid Representation of Graphs
(2011)
A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges ... |
Artículo
Transforming Triangulations on Nonplanar Surfaces
(2010)
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be ... |
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(2009)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ... |
Ponencia
On some partitioning problems for two-colored point sets
(Prensas de la Universidad de Zaragoza, 2009)
Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 pairwise ... |
Ponencia
K-Factores en nubes bicromáticas
(2007)
Consideramos una colección de puntos bicromática y nos preguntamos cuántos puntos adicionales son necesarios considerar ... |
Artículo
Dilation-free graphs in the l1 metric
(2007)
The dilation-free graph of a planar point set S is a graph that spans S in such a way that the distance between two points ... |
Artículo
Cover Contact Graphs
(2007)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) ... |
Artículo
A new 2D tessellation for angle problems: The polar diagram
(2006)
The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but ... |
Ponencia
Motion Planning and Visibility Problems using the Polar Diagram
(European Association for Computer Graphics, 2003)
Motion planning and visibility problems are some of the most important topics studied in Computer Graphics, Computational ... |
Artículo
Transforming triangulations on non planar-surfaces
(2003)
We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be ... |
Ponencia
More results about spanners in the l1-metric
(Universidad de Sevilla, 2003)
In this work we study more questions about spanners in the l1-metric. Concretely, we will see that adding some Steiner ... |
Ponencia
Puntos en posición general para una λ-distancia
(Alberto Márquez, 2002)
|
Tesis Doctoral
El diagrama polar
(2002)
|
Artículo
Diagonal flips in outer-triangulations on closed surfaces
(2002)
We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal flips, up to isotopy, if they have a sufficiently large and equal number of vertices. |
Ponencia
Spanners in l1
(University of Fredericton, 2000)
|
Tesis Doctoral
Geometría computacional en superficies no planas
(1998)
De forma general, la Geometría Computaciones trata del estudio de algoritmos que resuelven problemas geométricos con el ... |
Ponencia
Anchura de un convexo en la esfera.
(1997)
Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias ... |
Ponencia
Diameter of a set on the cylinder
(Queen's University, 1997)
|
Ponencia
the width of a convex set on the sphere
(Queen's University, 1997)
|