Now showing items 81-100 of 335

    • 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

      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

      Note on the number of obtuse angles in point sets 

      Fabila Monroy, Ruy; Huemer, Clemens; Tramuns Figueras, Eulàlia (2013)
      In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines ...
    • Presentation
      Icon

      Empty convex polytopes in random point sets 

      Balogh, József; González Aguilar, Hernán; Salazar Anaya, Gelasio (2013)
      Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices ...
    • 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

      A symbolic-numeric dynamic geometry environment for the computation of equidistant curves 

      Abánades Astudillo, Miguel Ángel; Botana Ferreiro, Francisco (2013)
      A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ...
    • 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

      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

      Drawing the double circle on a grid of minimum size 

      Bereg, Sergey; Fabila Monroy, Ruy; Flores Peñaloza, David; Lopez, Mario A.; Pérez Lantero, Pablo (2013)
      In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ...
    • 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

      Equipartitioning triangles 

      Ramos Alonso, Pedro Antonio; Steiger, William (2013)
      An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ...
    • Presentation
      Icon

      Abstract Voronoi diagrams 

      Klein, Rolf (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.
    • Presentation
      Icon

      Distance domination, guarding and vertex cover for maximal outerplanar graphs 

      Canales Cano, Santiago; Hernández Peñalver, Gregorio; Oliveira Martins, Ana Mafalda de; Matos. Inês (2013)
      In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and ...
    • Presentation
      Icon

      On the enumeration of permutominoes 

      Nunes Gomes Tomás, Ana Paula (2013)
      Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...
    • Presentation
      Icon

      An algorithm that constructs irreducible triangulations of once-punctured surfaces 

      Chávez de Diego, María José; Lawrecenko, Serge; Portillo Fernández, José Ramón; Villar Liñán, María Trinidad (2013)
      A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...
    • Presentation
      Icon

      Computing the stretch of an embedded graph 

      Cabello Justo, Sergio; Chimani, Markus; Hliněný, Petr (2013)
      Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the ...
    • Presentation
      Icon

      On the barrier-resilience of arrangements of ray-sensors 

      Kirkpatrick, David; Yang, Boting; Zilles, Sandra (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 ...
    • 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

      Metaheuristic approaches for the minimum dilation triangulation problem 

      Dorzán, María Gisela; Leguizamón, Mario Guillermo; Mezura Montes, Efrén; Hernández Peñalver, Gregorio (2013)
      We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ...
    • 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 ...