2
$\begingroup$

What algorithms currently exist to determine the convex kernel of any low-dimensional set, especially a planar set? Also, if one exists, what research has been done on it and are there any references with which you could supply me?

Thanks

  • 0
    @PatrickDaSilva Yes, you are essentially right. More specifically, the convex kernel of a set V is the set of all$x$such that for any y in V, the line between x and y is in V.2012-03-19

1 Answers 1

1

[Upgraded from comments as suggested.]

This paper seems relevant: Lee and Preparata, "An optimal algorithm for finding the kernel of a polygon", JACM 26.3 (1979), doi:10.1145/322139.322142