Subject: CGAL users discussion list
List archive
[cgal-discuss] about accessing end points of dual voronoi edge of a triangle inside a triangulation
Chronological Thread
- From: Kwok Jasper <>
- To: <>
- Subject: [cgal-discuss] about accessing end points of dual voronoi edge of a triangle inside a triangulation
- Date: Mon, 2 Mar 2009 14:02:49 +0800
- Importance: Normal
Excuse me. I have used the following to find out the dual voronoi edge of a triangle in a triangulation. CGAL:Object obj = Dt.dual(*temp); //where temp is a facet iterator Segment ve; if (assign(ve, obj)) { temp_dual_voronoi_edge_of_triangle.start(); //then, I tried to acess the end points of the dual voronoi edge by using these 2 lines of codes temp_dual_voronoi_edge_of_triangle.end(); } by using the start() and end() function, I can get the end points of the dual voronoi edge as a type of Point May I ask if I want to get such end points as a type of Vertex_handle of the triangulation instead of type Point, then what may I do ? I cannot found any function in the CGAL manual which do the above directly in a single step. Thank you very much 收發郵件以外 - 了解更多Windows Live™卓越功能 收發郵件以外更多功能 |
- [cgal-discuss] about accessing end points of dual voronoi edge of a triangle inside a triangulation, Kwok Jasper, 03/02/2009
- RE: [cgal-discuss] about accessing end points of dual voronoi edge, Kwok Jasper, 03/02/2009
- Re: [cgal-discuss] about accessing end points of dual voronoi edge, Manuel Caroli, 03/02/2009
Archive powered by MHonArc 2.6.16.