Subject: CGAL users discussion list
List archive
- From: "Qu Yang" <>
- To:
- Subject: [cgal-discuss] Delaunay Triangulation to Boost Graph
- Date: Sat, 29 Nov 2008 23:06:45 +1000
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type; b=VpCMcZbeqZFsDAAI2tK4R6l4yQ1xERU9QVInNbdoMfRdlBQ8HWXvrIns6Tkc6hVksm s8vvHouhngs/2kDZYWKu04aX9RPPOhUdfoqzS5z+MrE3m8DD18Xt3jUgnBVWgnDQ9IJT XDFZv8ctvwoVyEyxWNSXr6AiP/N7qJfRtfVNc=
Hi all,
I've been trying to convert a delaunay triangulation (DT) to a boost graph.
I want to some operation, such as removing edges in the obtained graph.
The provided example that uses a filtered graph only return a reference to DT.
How can I get a deep copy of the filered graph?
Yang
- [cgal-discuss] Delaunay Triangulation to Boost Graph, Qu Yang, 11/29/2008
Archive powered by MHonArc 2.6.16.