Subject: CGAL users discussion list
List archive
[cgal-discuss] 7 of 2,687 visit all cells incident to a given vertex in 3D triangulation data structure
Chronological Thread
- From: Tianyun Su <>
- To:
- Subject: [cgal-discuss] 7 of 2,687 visit all cells incident to a given vertex in 3D triangulation data structure
- Date: Tue, 22 Mar 2016 14:04:24 +0800
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:0RkwBRDzS98pQBk1AExjUyQJP3N1i/DPJgcQr6AfoPdwSP74r8bcNUDSrc9gkEXOFd2CrakU26yP6Ou/CCQp2tWojjMrSNR0TRgLiMEbzUQLIfWuLgnFFsPsdDEwB89YVVVorDmROElRH9viNRWJ+iXhpQAbFhi3DwdpPOO9QteU1JTnkbnpsMKCKyxzxxODIppKZC2sqgvQssREyaBDEY0WjiXzn31TZu5NznlpL1/A1zz158O34YIxu38I46FppIZ8VvDxcK08CLBZFz87KHsd5cvxtBCFQxHcyGEbVzAqkxNOEhXDpCrnFsPtsyL8p/d7njKHFcLzRLEwHz+l6vE4G1fTlC4bOmthoynsgctqgfcDrQ==
Dear all,
I want to visit all cells incident to a given vertex in 3D
triangulation data structure. In 2D Triangulation Data Structure,
there is vertex_circulator to implement the function. But in
3D triangulation data structure, there is no vertex_circulator. If
there is another function to visit all cells incident to a given
vertex in 3D triangulation data structure?
Thanks.
Tianyun
- [cgal-discuss] 7 of 2,687 visit all cells incident to a given vertex in 3D triangulation data structure, Tianyun Su, 03/22/2016
- Re: [cgal-discuss] 7 of 2,687 visit all cells incident to a given vertex in 3D triangulation data structure, Andreas Fabri, 03/22/2016
Archive powered by MHonArc 2.6.18.