48 citations · 101 across the 24 of their papers we have counts for
36 papers
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in
Boris Aronov, Mark de Berg, Leonidas Theocharous
Let be a (well-behaved) shortest-path metric defined on a path-connected subset of and let be a set of geodesic disks with respe…
A General Technique for Searching in Implicit Sets via Function Inversion
Boris Aronov, Jean Cardinal, Justin Dallant +1
In recent years, the Fiat-Naor function inversion scheme has been used to disprove conjectures in fine-grained complexity theory and design state of the art data structures for a n…
Partitioning axis-parallel lines in 3D
Boris Aronov, Abdul Basit, Mark de Berg +1
Let be a set of axis-parallel lines in . We are are interested in partitions of by a set of three planes such that each open cell in the ar…
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
Pankaj K. Agarwal, Boris Aronov, Esther Ezra +2
Let be a set of flat (planar) semi-algebraic regions in of constant complexity (e.g., triangles, disks), which we call plates. We wish to preproces…
Subquadratic Algorithms for Some \textsc{3Sum}-Hard Geometric Problems in the Algebraic Decision Tree Model
Boris Aronov, Mark de Berg, Jean Cardinal +3
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Gi…
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
Pankaj K. Agarwal, Boris Aronov, Tzvika Geft +1
Assembly planning is a fundamental problem in robotics and automation, which involves designing a sequence of motions to bring the separate constituent parts of a product into thei…