Now showing items 25-36 of 68

  • On k-enclosing objects in a coloured point set 

    Barba, Luis; Durocher, Stephane; Fraser, Robert; Hurtado Díaz, Fernando Alfredo; Mehrabi, Saeed; Mondal, Debajyoti; Morrison, Jason Morrison; Skala, Matthew; Wahid, Mohammad Abdul (2014)
    Conference report
    Open Access
    We 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 ), ...
  • Cell-paths in mono- and bichromatic line arrangements in the plane 

    Aichholzer, Oswin; Cardinal, Jean; Hackl, Thomas; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Pilz, Alexander; Silveira, Rodrigo Ignacio; Uehara, Ryuhei; Vogtenhuber, Birgit; Welzl, Emo (2014)
    Conference report
    Open Access
    We 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 

    Montes Lozano, Antonio; Wibmer, Michael (2014)
    Conference report
    Restricted access - publisher's policy
    We 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 

    Abanades, Miguel A.; Botan, Francisco; Montes Lozano, Antonio; Recio Muñiz, Tomás (2014)
    Conference report
    Restricted access - publisher's policy
    We 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 degree-diameter problem in maximal bipartite planar graphs 

    Dalfó Simó, Cristina; Huemer, Clemens; Salas, Julian (2014)
    Conference lecture
    Open Access
    The (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 

    Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio; Speckmann, Bettina (Springer, 2013)
    Conference report
    Open Access
    We 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 open-source toolbox for motion analysis of closed-chain mechanisms 

    Porta Pleite, Josep Maria; Ros Giralt, Lluís; Bohigas Nadal, Oriol; Manubens Ferriol, Montserrat; Rosales Gallegos, Carlos; Jaillet, Leonard Georges (Springer, 2013)
    Conference report
    Open Access
    Many situations in Robotics require an effective analysis of the motions of a closed-chain mechanism. Despite appearing very often in practice (e.g. in parallel manipulators, reconfigurable robots, or molecular compounds), ...
  • Stabbing simplices of point sets with k-flats 

    Cano, Javier; Hurtado Díaz, Fernando Alfredo; Urrutia Galicia, Jorge (Universidad de Sevilla, 2013)
    Conference report
    Open Access
    Let S be a set of n points inRdin general position.A set H of k-flats is called an mk-stabber of S if the relative interior of anym-simplex with vertices in S is intersected by at least one element of H. In thispaper we ...
  • Witness bar visibility graphs 

    Cortés, Carmen; Hurtado Díaz, Fernando Alfredo; Márquez, Alberto; Valenzuela, Jesús (2013)
    Conference report
    Open Access
    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 ...
  • Stabbing Segments with Rectilinear Objects 

    Claverol Aguas, Mercè; Seara Ojea, Carlos; Garijo, Delia; Korman, M.; Silveira, Rodrigo Ignacio (2013)
    Conference report
    Restricted access - publisher's policy
    Given 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 

    Claverol Aguas, Mercè; Garijo, Delia; Hurtado Díaz, Fernando Alfredo; Lara Cuevas, María Dolores; Seara Ojea, Carlos (Universidad de Sevilla, 2013)
    Conference report
    Open Access
    It 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 

    Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (Springer, 2013)
    Conference report
    Restricted access - publisher's policy
    We 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 ...