Congreso de Geometría Computacional (15º. 2013. Sevilla)
Recent Submissions

Recent developments on the crossing number of the complete graph [Presentation]
(2013) 
Flips in combinatorial pointed pseudotriangulations with face degree at most four [Presentation]
(2013)In this paper we consider the flip operation for combinatorial pointed pseudotriangulations where faces have size 3 or ...

Monotone crossing number of complete graphs [Presentation]
(2013)In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n1/2/2 n−2/2 ...

On 4connected geometric graphs [Presentation]
(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 4connected noncrossing geometric graph on S.

Phase transitions in the RamseyTurán theory [Presentation]
(2013)Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an Lfree graph on n ...

The alternating path problem revisited [Presentation]
(2013)It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric ...

Witness bar visibility [Presentation]
(2013)Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...

On making a graph crossingcritical [Presentation]
(2013)A graph is crossingcritical if its crossing number decreases when we remove any of its edges. Recently it was proved that ...

On three parameters of invisibility graphs [Presentation]
(2013)The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ...

Improved enumeration of simple topological graphs [Presentation]
(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 ...

Stackable tessellations [Presentation]
(2013)We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ...

Stabbing simplices of point sets with kflats [Presentation]
(2013)Let S be a set of n points in Rd in general position. A set H of kflats is called an mkstabber of S if the relative ...

Note on the number of obtuse angles in point sets [Presentation]
(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 ...

Empty convex polytopes in random point sets [Presentation]
(2013)Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices ...

Simulating distributed algorithms for lattice agents [Presentation]
(2013)We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2and 3dimensional ...

A symbolicnumeric dynamic geometry environment for the computation of equidistant curves [Presentation]
(2013)A webbased system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ...

Simulated annealing applied to the MWPT problem [Presentation]
(2013)The Minimum Weight PseudoTriangulation (MWPT) problem is suspected to be NPhard. We show here how Simulated Annealing ...

SensoGraph: Using proximity graphs for sensory analysis [Presentation]
(2013)Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ...

Drawing the double circle on a grid of minimum size [Presentation]
(2013)In 1926, Jarník introduced the problem of drawing a convex ngon with vertices having integer coordinates. He constructed ...

On the nonexistence of kreptile simplices in R3 and R4 [Presentation]
(2013)A ddimensional simplex S is called a kreptile (or a kreptile simplex) if it can be tiled without overlaps by k simplices ...