简体   繁体   中英

How to detect boundary points

I have a set of points in a 2D plane. I need to detect only the points that belong to the shape that borns from the union of this subset of points in order to cover the largest area: that is, the boundary points.

The following figure is an example:

一套点

The red points are those ones I need to detect.

What you need is called Convex hull . A lot of algorithms exist to calculate it.

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM