activity
20082011
most citedPoint sets that minimize -edges, 3-decomposable drawings, and the rectilinear crossing number of

12 citations · 15 across the 3 of their papers we have counts for

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2011

Visibility-preserving convexifications using single-vertex moves

Bernardo M. Abrego, Mario Cetina, Jesus Leanos +1

Devadoss asked: (1) can every polygon be convexified so that no internal visibility (between vertices) is lost in the process? Moreover, (2) does such a convexification exist, in w…