4 citations · 8 across the 6 of their papers we have counts for
6 papers
Asymmetric polygons with maximum area
L. Barba, L. E. Caraballo, J. M. Díaz-Báñez +2
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given diameters of a circle and a positive…
A linear-time algorithm for the geodesic center of a simple polygon
Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3
Given two points in a simple polygon of vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within . The geod…
Continuous Yao Graphs
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +5
In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points and an angle , we define the continuous Yao grap…
Compatible Connectivity-Augmentation of Planar Disconnected Graphs
Greg Aloupis, Luis Barba, Paz Carmi +3
Motivated by applications to graph morphing, we consider the following \emph{compatible connectivity-augmentation problem}: We are given a labelled -vertex planar graph, $\mathc…
Top-Down Skiplists
Luis Barba, Pat Morin
We describe todolists (top-down skiplists), a variant of skiplists (Pugh 1990) that can execute searches using at most binary comparisons per search…
Circle separability queries in logarithmic time
Greg Aloupis, Luis Barba, Stefan Langerman
Let be a set of points in the plane. In this paper we study a new variant of the circular separability problem in which a point set is preprocessed so that one can quic…