Subject: CGAL users discussion list
List archive
- From: "Mengda Wu" <>
- To:
- Subject: Fast picking of a face in Polyhedron
- Date: Thu, 15 May 2008 12:43:11 -0700
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type; b=QL9xEJL/DP5Ew7Mqn7MGssog0Ak27m2CDlHE6VUaPoN5JszdTx4YAsVkbOoHVi7W4vH1TjIz7PcMFK/66zzPcE+qM8HZAH7nbgSfGtEDBvR5XHKRxoE8AmsOCKrGnqMnGuMpyxTOg+0Y9Fwddki7Y3fcXTXFDq0YZIspsSbhlmk=
Hi all,
Is there a better way to pick a face with a known index fast (better than O(number of faces in the polyhedron)) ?
I am using std::advance(firstface, index) which seems very slow for a polyhedron with many faces. I have to stay with
the list implementation of Polyhedron, because sometimes I would like to remove faces.
Thanks,
Mengda
- Fast picking of a face in Polyhedron, Mengda Wu, 05/15/2008
Archive powered by MHonArc 2.6.16.