5 citations · 5 across the 4 of their papers we have counts for
5 papers
Approximating the Smallest -Enclosing Geodesic Disc in a Simple Polygon
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
We consider the problem of finding a geodesic disc of smallest radius containing at least points from a set of points in a simple polygon that has vertices, of whic…
On the Restricted -Steiner Tree Problem
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
Given a set of points in and an input line in , we present an algorithm that runs in optimal time and space to solve a…
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati
In this paper we study the area requirements of planar greedy drawings of triconnected planar graphs. Cao, Strelzoff, and Sun exhibited a family of subdivisions of triconn…
Pole Dancing: 3D Morphs for Tree Drawings
Elena Arseneva, Prosenjit Bose, Pilar Cano +5
We study the question whether a crossing-free 3D morph between two straight-line drawings of an -vertex tree can be constructed consisting of a small number of linear morphing s…
On Planar Greedy Drawings of 3-Connected Planar Graphs
Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati
A graph drawing is if, for every ordered pair of vertices , there is a path from to such that the Euclidean distance to decreases monotonically…