确保所有点都在三角剖分的凸包上
[英]Ensuring that all points are on the convex hull of a triangulation
问题描述
I currently have a program that takes in a set of points, triangulates it using CGAL, and then extracts the convex hull of these points. 
我目前有一个程序，该程序接受一组点，使用CGAL对其进行三角剖分，然后提取这些点的凸包。 However, I was wondering, instead of finding the convex hull of the points, how can I create a triangulation such that all points are on the convex hull of the triangulation? 但是，我想知道，不是找到这些点的凸包，我如何创建三角剖分，使所有点都在三角剖分的凸包上？ I don't want any code, but was wondering how I would go about implementing this in CGAL. 我不需要任何代码，但是想知道如何在CGAL中实现它。 Please let me know if you need any more clarification, and any help would be awesome! 如果您需要进一步说明，请告诉我，我们将为您提供任何帮助！
1 个解决方案
解决方案1
0 2015-07-20 20:43:47
Cgal uses incremental algorithm. Cgal使用增量算法。 Maybe you can check when a point shares more then 2 vertices in the triangulation and if so mark it as visited and delete all newly formed triangles. 也许您可以检查三角剖分中一个点共享的顶点多于2个，如果标记为已访问，则删除所有新形成的三角形。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.