Anthony D'Angelo

activity

20182023

k

-Steiner Tree Problem

5 citations · 5 across the 2 of their papers we have counts for

collaborators

3 papers

cs.CG2023★ 5 cited

On the Restricted $k$ -Steiner Tree Problem

Prosenjit Bose, Anthony D'Angelo, Stephane Durocher

Given a set $P$ of $n$ points in $R^{2}$ and an input line $γ$ in $R^{2}$ , we present an algorithm that runs in optimal $Θ (n lo g n)$ time and $Θ (n)$ space to solve a…

cs.CG2020

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 $H$ of subdivisions of triconn…

cs.CG2018

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 $n$ -vertex tree can be constructed consisting of a small number of linear morphing s…

On the Restricted k-Steiner Tree Problem

On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs

Pole Dancing: 3D Morphs for Tree Drawings

On the Restricted $k$ -Steiner Tree Problem