Listar Congreso de Geometría Computacional (15º. 2013. Sevilla) por título
Mostrando ítems 1-20 de 35
-
Ponencia
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 ...
-
Ponencia
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
An algorithm that constructs irreducible triangulations of once-punctured surfaces
(2013)A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...
-
Ponencia
Computing the stretch of an embedded graph
(2013)Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the ...
-
Ponencia
Continuous surveillance of points by rotating floodlights
(2013)Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the ...
-
Ponencia
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 ...
-
Ponencia
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 ...
-
Ponencia
Empty convex polytopes in random point sets
(2013)Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices ...
-
Ponencia
Equipartitioning triangles
(2013)An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ...
-
Ponencia
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 ...
-
Ponencia
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 ...
-
Ponencia
Improved enumeration of simple topological graphs
(2013)A simple topological graph T = (V (T ), E(T )) is a drawing of a graph in the plane where every two edges have at most one ...
-
Ponencia
Metaheuristic approaches for the minimum dilation triangulation problem
(2013)We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ...
-
Ponencia
Monotone crossing number of complete graphs
(2013)In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n-1/2/2 n−2/2 ...
-
Ponencia
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 ...
-
Ponencia
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
On making a graph crossing-critical
(2013)A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that ...
-
Ponencia
On the barrier-resilience of arrangements of ray-sensors
(2013)Given an arrangement A of n sensors and two points s and t in the plane, the barrier resilience of A with respect to s and ...
-
Ponencia
On the enumeration of permutominoes
(2013)Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...
-
Ponencia
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 ...