Exploració per autor "Bose, Prosenjit"

Ara es mostren els items 10-17 de 17

    • On approximating shortest paths in weighted triangular tessellations 

      Bose, Prosenjit; Esteban Pascual, Guillermo; Orden Martin, David; Silveira, Rodrigo Ignacio (Springer, 2022)
      Text en actes de congrés
      Accés obert
      We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional ...

    • On approximating shortest paths in weighted triangular tessellations 

      Bose, Prosenjit; Esteban Pascual, Guillermo; Orden Martin, David; Silveira, Rodrigo Ignacio (2023-05-01)
      Article
      Accés obert
      We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional ...

    • On computing enclosing isosceles triangles and related problems 

      Bose, Prosenjit; Mora Giné, Mercè; Seara Ojea, Carlos; Sethia, Saurabh (2011-02)
      Article
      Accés obert
      Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study a 3-dimensional version of the problem ...

    • On structural and graph theoretic properties of higher order Delaunay graphs 

      Abellanas, Manuel; Bose, Prosenjit; García López de Lacalle, Jesús; Hurtado Díaz, Fernando Alfredo; Nicolás, Carlos M.; Ramos, Pedro A. (2009-12)
      Article
      Accés obert
      Given a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a graph with vertex set $\emph{P}$ and an edge exists between two points p,q ∊ $\emph{P}$ when there is a circle through ...

    • Pole Dancing: 3D Morphs for Tree Drawings 

      Arseneva, Elena; Bose, Prosenjit; Cano Vila, María del Pilar; D'Angelo, Anthony; Dujmovic, Vida; Frati, Fabrizio; Langerman, Stefan; Tappini, Alessandra (Springer, 2018)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We study the question whether a crossing-free 3D morph between two straight-line drawings of an n-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the ...

    • Sequences of spanning trees for L-infinity Delaunay triangulations 

      Bose, Prosenjit; Cano Vila, María del Pilar; Silveira, Rodrigo Ignacio (2018)
      Text en actes de congrés
      Accés obert
      We extend a known result about L2-Delaunay triangulations to L∞-Delaunay. Let TS be the set of all non-crossing spanning trees of a planar n-point set S. We prove that for each element T of TS, there exists a length-decreasing ...

    • Some properties of higher order delaunay and gabriel graphs 

      Bose, Prosenjit; Collette, Sébastien; Hurtado Díaz, Fernando Alfredo; Korman, Matias; Langerman, Stefan; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
      Text en actes de congrés
      Accés obert
      We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties ...

    • Spanning ratio of shortest paths in weighted square tessellations 

      Bose, Prosenjit; Esteban Pascual, Guillermo; Orden Martin, David; Silveira, Rodrigo Ignacio (2022)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Continuous 2-dimensional space is often discretized by considering a grid of weighted square cells. In this work we study how well a weighted tessellation approximates the space, with respect to shortest paths. In particular, ...