Skip to Content.
Sympa Menu

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

Subject: CGAL users discussion list

List archive

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


Chronological Thread 
  • From: "daiycheng" <>
  • To: "cgal-discuss" <>
  • Subject: Re: Re: [cgal-discuss] normal vector for large point data
  • Date: Sun, 27 Dec 2009 09:41:18 +0800
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=date:from:to:references:subject:message-id:x-mailer:mime-version :content-type; b=X7tSINwKATLhKjKnaXZHZwrGZnkA+nQHE4MPs7cbU6L1RlCIjePtpLZ+yvszrNKvzi V/WIuak5Fx4o3KxwjV96tKbYGnQLEBBRDHWLfi++8yN7LalNalKNr+5Em9fGSFW8CLMg Ar+BFLePNWG/dZD4gBNOEa4ZFEFOXIPjM1EWg=

ANN is a library written in the C++ programming language to support both
exact and approximate nearest neighbor searching in spaces of various
dimensions.  It was implemented by David M. Mount of the University of
Maryland, and Sunil Arya of the Hong Kong University of Science and
Technology.  ANN (pronounced like the name ``Ann'') stands for
Approximate Nearest Neighbors.  ANN is also a testbed containing
programs and procedures for generating data sets, collecting and
analyzing statistics on the performance of nearest neighbor algorithms
and data structures, and visualizing the geometric structure of these
data structures.
The ANN source code and documentation is available from the following
web page:
    http://www.cs.umd.edu/~mount/ANN
For more information on ANN and its use, see the ``ANN Programming
Manual,'' which is provided with the software distribution.
 
 
2009-12-27

daiycheng

发件人: Zheng,Guang
发送时间: 2009-12-27  01:06:46
收件人: cgal-discuss
抄送:
主题: Re: [cgal-discuss] normal vector for large point data
could you tell me a little bit more about ANN?

2009/12/26 杨成林 <>
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



--
Guang Zheng  





Archive powered by MHonArc 2.6.16.

Top of Page