2 papers
cs.CG2021
Approximate Nearest-Neighbor Search for Line Segments
Ahmed Abdelkader, David M. Mount
Approximate nearest-neighbor search is a fundamental algorithmic problem that continues to inspire study due its essential role in numerous contexts. In contrast to most prior work…
cs.CG2018
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida +4
We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled so…