8 citations · 19 across the 9 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2013
Flipping Edge-Labelled Triangulations
Prosenjit Bose, Anna Lubiw, Vinayak Pathak +1
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been…
cs.CG2013★ 8 cited
Self-Approaching Graphs
Soroush Alamdari, Timothy M. Chan, Elyot Grant +2
In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there i…
cs.CG2012
Flip Distance Between Two Triangulations of a Point-Set is NP-complete
Anna Lubiw, Vinayak Pathak
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether…