Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] normal vector for large point data

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] normal vector for large point data


Chronological Thread 
  • From: 杨成林 <>
  • To:
  • Subject: Re: [cgal-discuss] normal vector for large point data
  • Date: Sat, 26 Dec 2009 19:44:13 +0800
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type; b=SszxGAnSp9BvPHVUcya0aHKLqO5o/TTIcW8pdiAlE7SsmJ4K4+w2Zhbi2ABllz9CvD DrgO64Q0VLnm0Ma5I62WVoq7CcqcuDBTCE6JXL+uOdRSpGYdLOpaZu67oompV3ZlfKx5 D7fSdG7Kwwc4A9LY3261zEKIM5uvGKaVi92go=
The spatial searching package in CGAL is not very efficient. Maybe you should consider ANN.

2009/12/26 lhc_liuyu <>
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" <> 写道：

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

Archive powered by MHonArc 2.6.16.

Top of Page