activity
20122021
most citedDynamic Model Pruning with Feedback

87 citations · 104 across the 5 of their papers we have counts for

collaborators
Showing cs.CGShow all

6 papers · 1 filter

cs.CG20198 cited

Sharing a pizza: bisecting masses with two cuts

Luis Barba, Alexander Pilz, Patrick Schnider

Assume you have a pizza consisting of four ingredients (e.g., bread, tomatoes, cheese and olives) that you want to share with your friend. You want to do this fairly, meaning that…

cs.CG2018

Geodesic farthest-point Voronoi diagram in linear time

Luis Barba

Let be a simple polygon with vertices. For any two points in , the geodesic distance between them is the length of the shortest path that connects them among all paths c…

cs.CG2018

Asymmetric Convex Intersection Testing

Luis Barba, Wolfgang Mulzer

We consider asymmetric convex intersection testing (ACIT). Let be a set of points and a set of halfspaces in dimensions. We denot…

cs.CG2018

The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon

Eunjin Oh, Luis Barba, Hee-Kap Ahn

Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a…

cs.CG2016

Incremental Voronoi Diagrams

Sarah R. Allen, Luis Barba, John Iacono +1

We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram (and several vari…

cs.CG20138 cited

On the stretch factor of the Theta-4 graph

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +2

In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a path between any pair of vertices in this graph whose length is at most a constant…