aSchool of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada
2. As a subroutine for the above result, we show how to find the convex hull of any given subset of the vertices of P in linear worst-case time.
3. More generally, we show how to compute a triangulation of any given subset of the vertices or edges of P in almost linear time.
Keywords: Geometric optimization; Polygon triangulation; Convex hull
Copyright©北京勤云科技发展有限公司 京ICP备09084417号