Original post is edited after getting some suggestions;
I am looking for a fast algorithm which is able to detect outer most boundary of a plane for given set of points. Suppose, I have 3D point clouds and points are segmented as belonging to different (identified) planes. Now I want to extract outer most points of each plane. The problem can be considered as a 2D case by projecting x,y coordinates of each point to the XY Plane. So what I am expecting is fast, precise algorithm, which is able to detect all the boundary points along very irregular borders. convex hull doesnt fit for me as it fails on irregular cases.
•publications relavent to this, codes and psudo codes are expecting to implement in c++. thank you