Showing cs.CGShow all
2 papers · 1 filter
cs.CG2014
Planar lower envelope of monotone polygonal chains
Daniel Lu
A simple linear search algorithm running in time is proposed for constructing the lower envelope of vertices from monotone polygonal chains in 2D with vertice…
cs.CG2014
A fast 25/6-approximation for the minimum unit disk cover problem
Paul Liu, Daniel Lu
Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximatio…