3 citations · 6 across the 10 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2026
How to Catch Grid Points
Sariel Har-Peled, Elfarouk Harb, Qizheng He
Given a positive integer , we study the problem of finding a convex polygon of minimum perimeter that encloses exactly points of . We show that an optimal poly…
cs.CG2024
Shortest Path Separators in Unit Disk Graphs
Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
We introduce a new balanced separator theorem for unit-disk graphs involving two shortest paths combined with the 1-hop neighbours of those paths and two other vertices. This answe…
cs.CG2022
Revisiting Random Points: Combinatorial Complexity and Algorithms
Sariel Har-Peled, Elfarouk Harb
Consider a set of points picked uniformly and independently from for a constant dimension -- such a point set is extremely well behaved in many aspects. For e…