Subject: CGAL users discussion list
List archive
- From: 杨成林 <>
- To:
- Subject: Re: [cgal-discuss] normal vector for large point data
- Date: Sun, 10 Jan 2010 15:11: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=h3a/fmWYhFeY3qMOp9a+3xLQcU4iiZzpWvbZLtFs3scNAPe6b50gwwL4/mseiqRrw9 RrNuJsp/Aa3nIBvl63a/1Q4C+yHraTZr9o61l8CtLobKlb/KIYptFya2aP3tV9vCcMCG qcwZfgZQiu6aaF6TS370CWorRnYxCewAE9iws=
The homepage of STANN is at Google Sites, which is blocked by GFW.
2010/1/3 Bo Zhou <>
杨成林 wrote:
ANN is good, another multithreaded solution is STANN http://www.compgeom.com/~stannThe spatial searching package in CGAL is not very efficient. Maybe you should consider ANN.2009/12/26 lhc_liuyu < <mailto:>>
<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" <
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
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss
--
杨成林
Yang Chenglin
- 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.