Download PDFOpen PDF in browserDetecting Inclusions for O-convex hulls of Bichromatic Point SetsEasyChair Preprint 31864 pages•Date: April 16, 2020AbstractLet O be a set of lines through the origin. Given two disjoint sets of n red and n blue points in the plane, we study the problem of maintaining the subset of blue points contained in the O-convex hull of the red point set while we rotate O around the origin. We describe efficient algorithms to solve the problem when O contains two lines. We consider the case where we simultaneously rotate both lines, and the case where one line is rotated while the second one is kept fixed. Keyphrases: bichromatic point sets, inclusion detection, restricted orientation convex hull
|