Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Dense 3D Reconstruction

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Dense 3D Reconstruction


Chronological Thread 
  • From: Andreas Fabri <>
  • To:
  • Subject: Re: [cgal-discuss] Dense 3D Reconstruction
  • Date: Sun, 16 Aug 2009 17:48:34 +0200


Hi Indika,

Note that the point set processing package
http://www.cgal.org/Manual/beta/doc_html/cgal_manual/Point_set_processing_3/Chapter_main.html
offers what you are looking for
- normal estimation
- outlier removal
- ..

best regards,

andreas


Indika Tantrigoda wrote:
Hello,
Thank you very much for the information. The link you sent seems useful.
I should be able to work something out with this.

Regards,
Indika

2009/8/15 Bo Zhou < <mailto:>>

Indika Tantrigoda wrote:

He,
Thanks for the reply. I'll have a look at chapter 34. I did
however go through the link you mentioned.
The problem is that the methods given in the link such as
Possion surface reconstruction and using Octrees require
the surface normals. But these are not available, only the x,y,z
co-ordinates of the points which forms the point cloud.

Is there any method that can be used when the surface normals
are not present to construct a mesh ???

Regards,
Indika
2009/8/14 Bo Zhou <

<mailto:>

<mailto:

<mailto:>>>


Indika Tantrigoda wrote:

Hello,
I am in the middle of a research where I try to reconstruct a
3D model based on photographs.
So far I am able to obtain a sparse point could
containing the
points of the object. I have developed a point cloud
viewer in XNA to view this point cloud data.
What I would like to do is to generate a dense 3D model based
on this point could. Would this be possible with CGAL, if so
any advice would be very much appreciated.
I recently found out about CGAL and my knowledge in using
CGAL
is very minimal (non actually).

Thanks in advance.

Regards,
indika

Hi,

It seems that you want to reconstruct mesh from point cloud, you
could have a look at

*Chapter 34 3D Alpha Shapes*

or
to find some useful implementation here

http://www.cs.jhu.edu/~misha/Code/
<http://www.cs.jhu.edu/%7Emisha/Code/>
<http://www.cs.jhu.edu/%7Emisha/Code/>


Thanks.

-- /**
* Bo Zhou
* Blog : http://jedimaster.cnblogs.com
* Mobile : +86 13451813691
*/

-- You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss


Hello,

I think it's not difficult to generate per-vertex normal by CGAL,
you can generate a KDTree then lookup several nearest neighbors to
calculate the normal. I remember to use ANN library to do spatial
search because the CGAL's implementation is not fast enough.

The RBF implicit surface reconstruction method does not require
normal, but I have not found a public sources, you will see
something useful in this thesis here,

http://www.labri.fr/perso/preuter/research/thesis/index.html

Thanks.

-- You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss






Archive powered by MHonArc 2.6.16.

Top of Page