1 citations · 1 across the 2 of their papers we have counts for
7 papers · 1 filter
Capturing the Shape of a Point Set with a Line Segment
Nathan van Beusekom, Marc van Kreveld, Max van Mulken +3
Detecting location-correlated groups in point sets is an important task in a wide variety of applications areas. In addition to merely detecting such groups, the group's shape carr…
Segment Visibility Counting Queries in Polygons
Kevin Buchin, Bram Custers, Ivor van der Hoog +4
Let be a simple polygon with vertices, and let be a set of points or line segments inside . We develop data structures that can efficiently count the number of o…
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Zachary Abel, Hugo Akitaya, Man-Kwun Chiu +7
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e…
Uncertain Curve Simplification
Kevin Buchin, Maarten Löffler, Aleksandr Popov +1
We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contai…
Routing in Histograms
Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5
Let be an -monotone orthogonal polygon with vertices. We call a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizonta…
Line Segment Covering of Cells in Arrangements
Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen
Given a collection of line segments, we consider its arrangement and study the problem of covering all cells with line segments of . That is, we want to find a minimum-size…