10 citations · 25 across the 28 of their papers we have counts for
4 papers · 1 filter
Reconstruction of weakly simple polygons from their edges
Hugo A. Akitaya, Csaba D. Tóth
Given line segments in the plane, do they form the edge set of a \emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most , for any…
Multi-Colored Spanning Graphs
Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth
We study a problem proposed by Hurtado et al. (2016) motivated by sparse set visualization. Given points in the plane, each labeled with one or more primary colors, a \emph{col…
Recognizing Weakly Simple Polygons
Hugo Akitaya, Greg Aloupis, Jeff Erickson +1
We present an -time algorithm that determines whether a given planar -gon is weakly simple. This improves upon an -time algorithm by Chang, Erickson, a…
Pachinko
Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine +4
Inspired by the Japanese game Pachinko, we study simple (perfectly "inelastic" collisions) dynamics of a unit ball falling amidst point obstacles (pins) in the plane. A classic exa…