简体   繁体   中英

why treating the supertriangle's vertices in Bourke's Delaunay triangulation algorithm?

P. Bourke在这里提出了一种有趣的算法: http ://paulbourke.net/papers/triangulate/,但我不明白为什么他在“将超三角形顶点添加到顶点的末尾”中将超三角形的顶点添加到顶点列表的末尾。顶点列表”,因为通过创建超三角形自然可以对它们进行处理。

It's a detail of implementation (and the rest of the algorithm doesn't go down to that level).

In his data representation, a triangle is a triplet of vertices, and vertices are represented by their index in the vertex "list" (in fact an array). So after having computed the coordinates of the vertices of the supertriangle, he adds the vertices to the vertex list and then create the triangle using the three indices.

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