Buscar
Mostrando ítems 1-10 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 interior of any m-simplex with vertices in S is intersected by at least one element of H. In this paper ...
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 number of edges or the sum of the edge weights) of a cycle γ in G. The stretch of a graph embedded on ...
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 complexity status of the Minimum Dilation Triangulation problem for a general point set is unknown. ...
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 in food industries. Classical methods can be long and costly, making them less suitable for certain ...
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 to a large enough subset of entities that move close to each other for a given time interval. We present ...
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 Hamiltonian alternating path. In this work we prove that if we relax the constraint on the path ...
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 since then by the graph drawing community, and recently several generalizations and restricted ...
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 line graph consisting of points and segments. The method is based on an incremental insertion, taking ...
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 n−3/2. Generalizing the result by Ábrego et al. for 2-page book drawings, we prove this conjecture for ...
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 square/cubic lattice-based agents. This AgentSystem assumes that each agent is capable to change position ...