Listar Congreso de Geometría Computacional (15º. 2013. Sevilla) por fecha de publicación
Mostrando ítems 1-20 de 35
-
Ponencia
Stabbing simplices of point sets with k-flats
(2013)Let S be a set of n points in Rd in general position. A set H of k-flats is called an mk-stabber of S if the relative ...
-
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
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
SensoGraph: Using proximity graphs for sensory analysis
(2013)Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ...
-
Ponencia
Reporting flock patterns on the GPU
(2013)In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers ...
-
Ponencia
The alternating path problem revisited
(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 ...
-
Ponencia
Witness bar visibility
(2013)Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...
-
Ponencia
Parallel constrained Delaunay triangulation
(2013)In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight ...
-
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
Simulating distributed algorithms for lattice agents
(2013)We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional ...
-
Ponencia
On the enumeration of permutominoes
(2013)Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...
-
Ponencia
Solving common influence region queries with the GPU
(2013)In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under ...
-
Ponencia
Simulated annealing applied to the MWPT problem
(2013)The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing ...
-
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
Phase transitions in the Ramsey-Turán theory
(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 L-free graph on n ...
-
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
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
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
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
Three location tapas calling for CG sauce
(2013)Based on some recent modelling considerations in location theory we call for study of three CG constructs of Voronoi type that seem not to have been studied much before.