1 citations · 3 across the 8 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CG2018
Approximate Minimum-Weight Matching with Outliers under Translation
Pankaj K. Agarwal, Haim Kaplan, Geva Kipper +4
Our goal is to compare two planar point sets by finding subsets of a given size such that a minimum-weight matching between them has the smallest weight. This can be done by a tran…
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
Geometric Algorithms with Limited Workspace: A Survey
Bahareh Banyassady, Matias Korman, Wolfgang Mulzer
In the limited workspace model, we consider algorithms whose input resides in read-only memory and that use only a constant or sublinear amount of writable memory to accomplish the…