Buscar
Mostrando ítems 11-20 de 32
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 t is the minimum number of sensors whose removal permits a path from s to t such that the path ...
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 vertices with independence number less than f(n). Erdos and Sós asked if RT (n, K5, c√ n) = o (n2) for ...
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 if a non-planar graph G is obtained by adding an edge to a cubic polyhedral (planar 3-connected) ...
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 n, K can be expressed as the union of n convex sets with disjoint interiors and each having the same ...
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 problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a ...
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 surface. In this work we propose an algorithm that constructs the set of irreducible triangulations ...
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
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
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.