48 citations · 165 across the 65 of their papers we have counts for
Showing 2012 · cs.CGShow all
3 papers · 2 filters
cs.CG2012★ 2 cited
The number of distinct distances from a vertex of a convex polygon
Gabriel Nivasch, János Pach, Rom Pinchasi +1
Erdős conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P.…
cs.CG2012
A note on coloring line arrangements
Eyal Ackerman, Rom Pinchasi
We show that the lines of every arrangement of lines in the plane can be colored with colors such that no face of the arrangement is monochromatic. This i…
cs.CG2012★ 1 cited
The visible perimeter of an arrangement of disks
Gabriel Nivasch, János Pach, Gábor Tardos
Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter---the total length of all pieces of their b…