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
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
[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