1 citations · 1 across the 1 of their papers we have counts for
4 papers
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…
Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces
Mark de Berg, Ade Gunawan, Marcel Roeloffzen
We present a new algorithm for the widely used density-based clustering method DBscan. Our algorithm computes the DBscan-clustering in time in , irrespec…