CGAL users discussion list

["yao oldbig" <>]

Is there anything like "edge iterator"? It looks more convenient in this case by visiting edges in turn, because one edge corresponds to two vertices.

From:
To:
Date: Fri, 7 Mar 2008 00:42:00 +0800 (CST)
Subject: [cgal-discuss] Delaunay 3D and vertices normals

> Hi, I'm trying to solve this problem and I'm just wondering what is the best way of doing it. > > Basically, I've got a set of points describing a shape (They're basically the points of a surface triangulation in 3D). I've computed the normal at each point as the average normal of all the triangles incident to this point. Now I need to compute the 3D Delaunay tethraedisation and select those edges that form an angle with the normal that is less than a certain threshold. I'm using a vertex iterator to visit all the vertices and then I find all the incident cells to that vertex, then I think there should be a way of finding the edges incident to the vertex I'm considering (I know that in this way I'm visiting the same edge more than once, but is the only way I can think about now). Now it comes the problem, how can I associate a vertex with its normal?? My points are saved into a file in the form: > > x y z nx ny nz > > where the first three components are the coordinates of the point and the last three are the normal components. > I guess that the best way of dealing with these would be extending the concept of point and adding somehow the information about the normal to that and acces this using a method like point.get_Normal(). Is this a good approach? In this case which class should I modify? > > Thanks very much for your time and help > > Angelo T. > -- > You are currently subscribed to cgal-discuss. > To unsubscribe or access the archives, go to > https://lists-sop.inria.fr/wws/info/cgal-discuss >

---

中 国 最 强 网 游 --- 网 易 梦 幻 西 游 ，166 万 玩 家 同 时 在 线