48 citations · 101 across the 24 of their papers we have counts for
4 papers · 2 filters
Complexity of a Single Face in an Arrangement of s-Intersecting Curves
Boris Aronov, Dmitriy Drusvyatskiy
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(λ_s(n)), O(λ_…
How to Cover a Point Set with a V-Shape of Minimum Width
Boris Aronov, Muriel Dulieu
A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two…
Witness Rectangle Graphs
Boris Aronov, Muriel Dulieu, Ferran Hurtado
In a witness rectangle graph (WRG) on vertex point set P with respect to witness points set W in the plane, two points x, y in P are adjacent whenever the open isothetic rectangle…
Computing the Distance between Piecewise-Linear Bivariate Functions
Guillaume Moroz, Boris Aronov
We consider the problem of computing the distance between two piecewise-linear bivariate functions and defined over a common domain . We focus on the distance induced by…