Congreso de Geometría Computacional (15º. 2013. Sevilla): Envíos recientes
Mostrando ítems 21-35 de 35
-
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
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
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
On the enumeration of permutominoes
(2013)Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...
-
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
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
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
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
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
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
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
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
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
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 ...