Buscar
Mostrando ítems 41-50 de 67
Ponencia
Ponencia
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On 4-connected geometric graphs
(2013)
Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S.
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Finding a widest empty 1-corner corridor
(2004)
Given a set of n points in the plane, we consider the problem of computing a widest empty 1-corner corridor. We star giving a characterization of the 1-corner corridors that we call locally widest. Our approach to finding ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Abstract Voronoi diagrams
(2013)
Abstract Voronoi diagrams are a unifying framework that covers many types of concrete Voronoi diagrams. This talk reports on the state of the art, including recent progress.
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A symbolic-numeric dynamic geometry environment for the computation of equidistant curves
(2013)
A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely automatic way is presented. The system consists of an interactive drawing canvas where the bisector is ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On the nonexistence of k-reptile simplices in R3 and R4
(2013)
A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices with disjoint interiors that are all mutually congruent and similar to S. For d=2, triangular ...
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)
Sobre los multiplicadores entre espacios de Cesáro
(Universidad de Coimbra, 1985)
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Metodología integral de aprendizaje en Teoría de Circuitos
(Universidad de Sevilla, Facultad de Ciencias de la Educación, 2011)
Se describe un trabajo de innovación educativa basado en la utilización de varias técnicas docentes que complementan a la metodología tradicional existente, para generar una metodología integral en el aprendizaje de Teoría ...