37 citations · 192 across the 51 of their papers we have counts for
Showing 2018 · cs.CGShow all
3 papers · 2 filters
cs.CG2018
Convex Polygons in Cartesian Products
Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans +4
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of real numbers (for short, \emph{grid}). First, we prove that every…
cs.CG2018
Crossing Minimization in Perturbed Drawings
Radoslav Fulek, Csaba D. Tóth
Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a `compromised' drawing by a piecewise…
cs.CG2018
Maximum Area Axis-Aligned Square Packings
Hugo A. Akitaya, Matthew D. Jones, David Stalfa +1
Given a point set in the unit square , an anchored square packing is a set of interior-disjoint empty squares in such that is a co…