Subject: CGAL users discussion list
List archive
- From: Priyank Jain <>
- To:
- Subject: Re: [cgal-discuss] Polyhedron & OpenCL , mesh processing algorithm
- Date: Mon, 08 Feb 2010 11:33:37 -0500
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:user-agent:mime-version:to:subject:references :in-reply-to:content-type:content-transfer-encoding; b=Ja41pXfM/890CWp61GqVQAzDFqN9cX34qhUR/rOEEnfkhPl8hn79Qhhz+RnEUEW8N/ ZjcOLVO6ssvIK8efn/A5xgb7MmMHJM2Wt2YxWo101mP/HT6dXVMRYUkDpYfBvO8VTQ6V X6g/bclTiLeVEQ+uNBCsWEqO+gOspqoamUM30=
I have not had experience with openCL, but with polyhedron, yes. I am not sure what you are trying to do, but you can access the vertices using the vertex iterator model->vertices.begin() and model->vertices.end(). I think you can also use "circulators" which would give you vertices in a more ordered fashion.
Hope this helped you a bit.
/Priyank
On 2/8/2010 8:00 AM, Mohamed Yousef wrote:
Hello all,
I'm in the process of writing mesh processing algorithms that benefit from
OpenCL
the problem is that , in order to process vertices they have to be copied to
gpu , in random access array form
so the only option i can see is first to extract vertex information from the
half-edge , copy them into array , modify them in gpu , overwrite the
halfe-edge point values
but this is really too much overhead and memory usage problem , any one has
a better idea for the process or tackled OpenCL and CGAL before ?
Thanks
- [cgal-discuss] Polyhedron & OpenCL , mesh processing algorithm, Mohamed Yousef, 02/08/2010
- Re: [cgal-discuss] Polyhedron & OpenCL , mesh processing algorithm, Priyank Jain, 02/08/2010
Archive powered by MHonArc 2.6.16.