Now showing items 21-36 of 36

    • Presentation
      Icon

      On the nonexistence of k-reptile simplices in R3 and R4 

      Kynčl, Jan; Safernova, Zuzana (2013)
      A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices ...
    • Presentation
      Icon

      On three parameters of invisibility graphs 

      Cibulka, Josef; Korbelář, Miroslav; Kynčl, Jan; Mészáros, Viola; Stolař, Rudolf; Valtr, Pavel (2013)
      The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ...
    • Presentation
      Icon

      Parallel constrained Delaunay triangulation 

      Coll Arnau, Narcís; Guerrieri Basualdo, María Ethel (2013)
      In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight ...
    • Presentation
      Icon

      Phase transitions in the Ramsey-Turán theory 

      Balogh, József (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 ...
    • Presentation
    • Presentation
      Icon

      Reporting flock patterns on the GPU 

      Fort i Masdevall, Marta; Sellarès Chiva, Joan Antoni; Valladares Cereceda, Ignacio (2013)
      In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers ...
    • Presentation
      Icon

      SensoGraph: Using proximity graphs for sensory analysis 

      Miguel, David N. de; Orden Martín, David; Fernández Fernández, Encarnación; Rodríguez Nogales, José Manuel; Vila Crespo, Josefina (2013)
      Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ...
    • Presentation
      Icon

      Simulated annealing applied to the MWPT problem 

      Gagliardi, Edilma Olinda; Leguizamón, Mario Guillermo; Hernández Peñalver, Gregorio (2013)
      The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing ...
    • Presentation
      Icon

      Simulating distributed algorithms for lattice agents 

      Aichholzer, Oswin; Hackl, Thomas; Sacristán Adinolfi, Vera; Vogtenhuber, Birgit; Wallner, Reinhardt (2013)
      We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional ...
    • Presentation
      Icon

      Solving common influence region queries with the GPU 

      Fort i Masdevall, Marta; Sellarès Chiva, Joan Antoni (2013)
      In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under ...
    • Presentation
      Icon

      Some results on open edge guarding of polygons 

      Bajuelos Domínguez, António Leslie; Canales Cano, Santiago; Hernández Peñalver, Gregorio; Oliveira Martins, Ana Mafalda de; Matos. Inês (2013)
      This paper focuses on a variation of the Art Gallery problem that considers open edge guards. The “open” prefix means the ...
    • Presentation
      Icon

      Stabbing simplices of point sets with k-flats 

      Cano Vila, Javier; Hurtado Díaz, Ferran; Urrutia Galicia, Jorge (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 ...
    • Presentation
      Icon

      Stackable tessellations 

      Enrique Monzo, Lluís; Jaume Deyà, Rafel (2013)
      We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ...
    • Presentation
      Icon

      The alternating path problem revisited 

      Claverol Aguas, Mercè; Garijo Royo, Delia; Hurtado Díaz, Ferran; Lara Cuevas, María Dolores; Seara Ojea, Carlos (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 ...
    • Presentation
      Icon

      Three location tapas calling for CG sauce 

      Plastria, Frank (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.
    • Presentation
      Icon

      Witness bar visibility 

      Cortés Parejo, María del Carmen; Hurtado Díaz, Ferran; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (2013)
      Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...