Cette page appartient aux archives web de l'EPFL et n'est plus tenue à jour.
This page belongs to EPFL's web archive and is no longer updated.

# semester project journal #1

1 为曲面构造一个以三角形为基本元素的AABB树；
2 在曲面的bounding box里面随即取点，然后利用AABB树找到这些sample在曲面上的最近点；
3 以第二步中的点为基点，构造delaunay triangulation；
4 通过triangulation的对偶来获得voronoi diagram。

We have spent these weeks on Voronoi Segmentation of a given 3D surface. We implemented it with the help of the cgal library.

Steps :
1 Build an AABB tree for the surface(primitives are the triangles);
2 Random sample the bounding box of the surface, then take the nearest points of the samples on the surface as site points;
3 Build Delaunay Triangulation with those site points;
4 The dual of the triangulation will be a Voronoi Diagram.

Then we intersect the Voronoi Diagram with the surface to get a Voronoi Segmentation of the surface. The problem here is that cgal has no data structure available for such case.
We need to come up with a data structure which can store information of intersections, and information about the Voronoi structure.

We also got some problems in using cgal. We did not find any easy tutorial and the online manual of cgal is terrible.

Posted by Yunpeng Zhou on Saturday 17 November 2012 at 23:27
• Categories