20 citations · 134 across the 54 of their papers we have counts for
6 papers · 2 filters
Space-Efficient Hidden Surface Removal
Frank Kammer, Maarten Löffler, Rodrigo I. Silveira
We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. S…
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…
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection
Ingo van Duijn, Irina Kostitsyna, Marc van Kreveld +1
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane.…
On the complexity of minimum-link path problems
Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk +1
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings…
Grouping Time-varying Data for Interactive Exploration
Arthur van Goethem, Marc van Kreveld, Maarten Löffler +2
We present algorithms and data structures that support the interactive analysis of the grouping structure of one-, two-, or higher-dimensional time-varying data while varying all d…
Colored Spanning Graphs for Set Visualization
Ferran Hurtado, Matias Korman, Marc van Kreveld +6
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple…