Subject: CGAL users discussion list
List archive
- From: Bo Zhou <>
- To:
- Subject: Re: [cgal-discuss] normal vector for large point data
- Date: Sun, 03 Jan 2010 21:48:29 +0800
- 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; b=GGHzcn3kGIMqpLfaHZEXsQ1Sj2D9lLj6XVr9BNpjf3JRDP50wVjfRhL4WzvPLrlnc2 4AAW+K7WIE4Na+8PJtbKpeWYP805j/Fifk2snuSJsZjQWDR8CN0WYWiOQOCqziu2HJqL TUcYBOssdTbbz0xHDMK1JeWRIKNhS5TNwoSYs=
杨成林 wrote:
The spatial searching package in CGAL is not very efficient. Maybe you should consider ANN.ANN is good, another multithreaded solution is STANN http://www.compgeom.com/~stann
2009/12/26 lhc_liuyu
<
<mailto:>>
The method to compute the normal vector of each vertex in a any
size point cloud data can be found in journal of CAGD; I forget
the title of the paper;the details of the method is: find a
surface(paraboloid,such as) to fit the vertices in neigbor field
(a given radius),and the normal of the a surface can be considered
as the normal of vertex.
在2009-12-25,"Zheng,Guang"
<
<mailto:>>
写道:
Hi,
Has anyone compute the normal vector for a large size point
cloud data (more than 10M), it seems that the algorithm
provided by CGAL is not so efficient for this kind of size
dataset. Anyone has any suggestions about this?
Right now, my computer has been running more than 10 hours
(8CPU and 4G RAM, windows 64bit).
Thanks very much!
-- Guang
--
杨成林
Yang Chenglin
begin:vcard fn:Bo Zhou n:Zhou;Bo org:Autodesk China;M&E Division adr:;;Pudian Street 399;Shanghai;Shanghai;200122;China email;internet: title:Software Developer tel;cell:13501774529 x-mozilla-html:TRUE version:2.1 end:vcard
- Re: [cgal-discuss] normal vector for large point data, Bo Zhou, 01/03/2010
- Re: [cgal-discuss] normal vector for large point data, 杨成林, 01/10/2010
Archive powered by MHonArc 2.6.16.