48 citations · 101 across the 24 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CG2016
Eliminating Depth Cycles among Triangles in Three Dimensions
Boris Aronov, Edward Y. Miller, Micha Sharir
Given pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any , the triangles can be cut into $O(n…
cs.CG2016
Nearest-Neighbor Searching Under Uncertainty II
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled +3
Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of…
cs.CG2016★ 1 cited
Distance-Sensitive Planar Point Location
Boris Aronov, Mark de Berg, David Eppstein +2
Let be a connected planar polygonal subdivision with edges that we want to preprocess for point-location queries, and where we are given the probability tha…