7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.CG2026
Compatible Triangulations of Simple Polygons
Peyman Afshani, Boris Aronov, Kevin Buchin +5
Let and be simple polygons with vertices each. We wish to compute triangulations of and that are combinatorially equivalent, if they exist. We consider two vers…
math.CO2013★ 7 cited
Advantage in the discrete Voronoi game
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi +2
We study the discrete Voronoi game, where two players alternately claim vertices of a graph for t rounds. In the end, the remaining vertices are divided such that each player recei…