52 citations · 118 across the 27 of their papers we have counts for
38 papers
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square
Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy +5
Let be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of with a straight line segment. Color these edges red if the…
On -means for segments and polylines
Sergio Cabello, Panos Giannopoulos
We study the problem of -means clustering in the space of straight-line segments in under the Hausdorff distance. For this problem, we give a -approximat…
Connectivity with uncertainty regions given as line segments
Sergio Cabello, David Gajser
For a set of points in the plane and a real number , let be the graph defined on by connecting each pair of points at distance at most . We con…
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
Sergio Cabello, Arun Kumar Das, Sandip Das +1
A terrain is an -monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in time, w…
Long Plane Trees
Sergio Cabello, Michael Hoffmann, Katharina Klost +2
In the longest plane spanning tree problem, we are given a finite planar point set , and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}…
Faster Distance-Based Representative Skyline and -Center Along Pareto Front in the Plane
Sergio Cabello
We consider the problem of computing the \emph{distance-based representative skyline} in the plane, a problem introduced by Tao, Ding, Lin and Pei [Proc. 25th IEEE International Co…