Ponències/Comunicacions de congressos: Recent submissions
Now showing items 2536 of 68

On kenclosing objects in a coloured point set
(2014)
Conference report
Open AccessWe introduce the exact coloured k enclosing object problem: given a set P of n points in R 2 , each of which has an associated colour in f 1 ;:::;t g , and a vec tor c = ( c 1 ;:::;c t ), ... 
Cellpaths in mono and bichromatic line arrangements in the plane
(2014)
Conference report
Open AccessWe show that in every arrangement of n red and blue lines  in general position and not all of the same color  there is a path through a linear number of cells where red and blue lines are crossed alternatingly (and no ... 
Software for discussing parametric polynomial systems : the Gröbner cover
(2014)
Conference report
Restricted access  publisher's policyWe present the canonical Gröbner Cover method for discussing parametric polynomial systems of equations. Its objective is to decompose the parameter space into subsets (segments) for which it exists a generalized reduced ... 
Software using the Gröbner cover for geometrical loci computation and classification
(2014)
Conference report
Restricted access  publisher's policyWe describe here a properly recent application of the Gröbner Cover algorithm (GC) providing an algebraic support to Dynamic Geometry computations of geometrical loci. It provides a complete algebraic solution of locus ... 
The degreediameter problem in maximal bipartite planar graphs
(2014)
Conference lecture
Open AccessThe (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree and diameter D. We consider the (A ,D) problem for maximal planar bipartite ... 
Colored spanning graphs for set visualization
(Springer, 2013)
Conference report
Open AccessWe study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the ... 
An opensource toolbox for motion analysis of closedchain mechanisms
(Springer, 2013)
Conference report
Open AccessMany situations in Robotics require an effective analysis of the motions of a closedchain mechanism. Despite appearing very often in practice (e.g. in parallel manipulators, reconfigurable robots, or molecular compounds), ... 
Stabbing simplices of point sets with kflats
(Universidad de Sevilla, 2013)
Conference report
Open AccessLet S be a set of n points inRdin general position.A set H of kflats is called an mkstabber of S if the relative interior of anymsimplex with vertices in S is intersected by at least one element of H. In thispaper we ... 
Witness bar visibility graphs
(2013)
Conference report
Open AccessBar 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 ... 
Stabbing Segments with Rectilinear Objects
(2013)
Conference report
Restricted access  publisher's policyGiven a set of n line segments in the plane, we say that a region R of the plane is a stabber if R contains exactly one end point of each segment of the set. In this paper we provide efficient algorithms for determining ... 
The alternating path problem revisited
(Universidad de Sevilla, 2013)
Conference report
Open AccessIt is well known that, given "n" red points and "n" blue points on acircle, 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 ... 
New results on stabbing segments with a polygon
(Springer, 2013)
Conference report
Restricted access  publisher's policyWe consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon P if at least one of its two endpoints is contained in P. A segment set S is stabbed by P ...