Listar Congreso de Geometría Computacional (15º. 2013. Sevilla) por título
Mostrando ítems 16-35 de 35
-
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 ...
-
Ponencia
On three parameters of invisibility graphs
(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 ...
-
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
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
-
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
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
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
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
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
Some results on open edge guarding of polygons
(2013)This paper focuses on a variation of the Art Gallery problem that considers open edge guards. The “open” prefix means the ...
-
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
Stackable tessellations
(2013)We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ...
-
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
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.
-
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 ...