<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <link>http://www.mathworks.com/matlabcentral/newsreader/view_thread/162898</link>
    <title>MATLAB Central Newsreader - 3D surface recon from point cloud</title>
    <description>Feed for thread: 3D surface recon from point cloud</description>
    <language>en-us</language>
    <copyright>&amp;copy;1994-2012 by MathWorks, Inc.</copyright>
    <webmaster>webmaster@mathworks.com</webmaster>
    <generator>MATLAB Central Newsreader</generator>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <ttl>60</ttl>
    <image>
      <title>MathWorks</title>
      <url>http://www.mathworks.com/images/membrane_icon.gif</url>
    </image>
    <item>
      <pubDate>Wed, 30 Jan 2008 22:57:02 -0500</pubDate>
      <title>3D surface recon from point cloud</title>
      <link>http://www.mathworks.com/matlabcentral/newsreader/view_thread/162898#412093</link>
      <author>Ashish A</author>
      <description>Hello&lt;br&gt;
&lt;br&gt;
I have been working on a project to do a surface &lt;br&gt;
reconstruction from a point cloud.  I am writing my code &lt;br&gt;
in Matlab and using the algorithm described by Hoppe et &lt;br&gt;
al.  &lt;br&gt;
&lt;br&gt;
Step 1: finding k neighbors and using principal component &lt;br&gt;
analysis to find a center and a normal for the plane.&lt;br&gt;
&lt;br&gt;
Step 2: Orienting the normals: this is where I am having &lt;br&gt;
some difficulty.  I am generating a Euclidean minimum &lt;br&gt;
spanning tree in 3d based on the algorithm described at &lt;br&gt;
wikipedia.  Basically, first calculating Delaunay &lt;br&gt;
triangulation to calculate edges (distance between &lt;br&gt;
points).  Then starting from the point with highest z, I &lt;br&gt;
am using prim&amp;#8217;s algorithm to generate the EMST.  Once, I &lt;br&gt;
have the EMST, I am orienting the normal&amp;#8217;s to point &lt;br&gt;
outward.  &lt;br&gt;
&lt;br&gt;
Step 3:  Surface Contouring:  I am planning to use the &lt;br&gt;
marching cube algorithm but haven&amp;#8217;t written the code yet.&lt;br&gt;
&lt;br&gt;
The step 2 seems to work fine for small set of data points &lt;br&gt;
(sample data points up to 100-200) but when I try it with &lt;br&gt;
the actual data set (~20000 points), it seems to take it &lt;br&gt;
forever.  I have let it run for over 8 hours without &lt;br&gt;
getting any results.  Even if it is working, I don&amp;#8217;t think &lt;br&gt;
it is acceptable.  I am sure the surface contouring part &lt;br&gt;
will be computationally long as well.  So, my question is &lt;br&gt;
that are there any tricks that other have been using for &lt;br&gt;
orienting the normals of the tangent planes.  Or are there &lt;br&gt;
any already existing functions for this?&lt;br&gt;
&lt;br&gt;
My other question is about surface contouring.  I feel &lt;br&gt;
confident that if I can get the normal orientation right, &lt;br&gt;
I should be able to do this by a brute force marching cube &lt;br&gt;
algorithm.  But, I would like to use the iso-surface &lt;br&gt;
function of the matlab instead of writing the whole new &lt;br&gt;
code to generate facets information.  Any helpful pointers &lt;br&gt;
there?&lt;br&gt;
&lt;br&gt;
Many thanks,&lt;br&gt;
Ashish</description>
    </item>
    <item>
      <pubDate>Wed, 26 Mar 2008 13:38:02 -0400</pubDate>
      <title>Re: 3D surface recon from point cloud</title>
      <link>http://www.mathworks.com/matlabcentral/newsreader/view_thread/162898#422898</link>
      <author>Joel </author>
      <description>Can you send me a reference to this paper?&lt;br&gt;
I have a bunch of 2-D data points of a hallway in my &lt;br&gt;
building (laser scanner mounted on robot with SLAM).   And &lt;br&gt;
I want to plot it as a wireframe model of the hall way.&lt;br&gt;
&lt;br&gt;
Is this the type of algoirthm you would have to use?   or &lt;br&gt;
is there an easy way to do this? &lt;br&gt;
&lt;br&gt;
&quot;Ashish A&quot; &amp;lt;aashi6uf@mathworks.com&amp;gt; wrote in message &lt;br&gt;
&amp;lt;fnqvbu$mvm$1@fred.mathworks.com&amp;gt;...&lt;br&gt;
&amp;gt; Hello&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; I have been working on a project to do a surface &lt;br&gt;
&amp;gt; reconstruction from a point cloud.  I am writing my code &lt;br&gt;
&amp;gt; in Matlab and using the algorithm described by Hoppe et &lt;br&gt;
&amp;gt; al.  &lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Step 1: finding k neighbors and using principal &lt;br&gt;
component &lt;br&gt;
&amp;gt; analysis to find a center and a normal for the plane.&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Step 2: Orienting the normals: this is where I am having &lt;br&gt;
&amp;gt; some difficulty.  I am generating a Euclidean minimum &lt;br&gt;
&amp;gt; spanning tree in 3d based on the algorithm described at &lt;br&gt;
&amp;gt; wikipedia.  Basically, first calculating Delaunay &lt;br&gt;
&amp;gt; triangulation to calculate edges (distance between &lt;br&gt;
&amp;gt; points).  Then starting from the point with highest z, I &lt;br&gt;
&amp;gt; am using prim&amp;#8217;s algorithm to generate the EMST.  Once, I &lt;br&gt;
&amp;gt; have the EMST, I am orienting the normal&amp;#8217;s to point &lt;br&gt;
&amp;gt; outward.  &lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Step 3:  Surface Contouring:  I am planning to use the &lt;br&gt;
&amp;gt; marching cube algorithm but haven&amp;#8217;t written the code yet.&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; The step 2 seems to work fine for small set of data &lt;br&gt;
points &lt;br&gt;
&amp;gt; (sample data points up to 100-200) but when I try it &lt;br&gt;
with &lt;br&gt;
&amp;gt; the actual data set (~20000 points), it seems to take it &lt;br&gt;
&amp;gt; forever.  I have let it run for over 8 hours without &lt;br&gt;
&amp;gt; getting any results.  Even if it is working, I don&amp;#8217;t &lt;br&gt;
think &lt;br&gt;
&amp;gt; it is acceptable.  I am sure the surface contouring part &lt;br&gt;
&amp;gt; will be computationally long as well.  So, my question &lt;br&gt;
is &lt;br&gt;
&amp;gt; that are there any tricks that other have been using for &lt;br&gt;
&amp;gt; orienting the normals of the tangent planes.  Or are &lt;br&gt;
there &lt;br&gt;
&amp;gt; any already existing functions for this?&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; My other question is about surface contouring.  I feel &lt;br&gt;
&amp;gt; confident that if I can get the normal orientation &lt;br&gt;
right, &lt;br&gt;
&amp;gt; I should be able to do this by a brute force marching &lt;br&gt;
cube &lt;br&gt;
&amp;gt; algorithm.  But, I would like to use the iso-surface &lt;br&gt;
&amp;gt; function of the matlab instead of writing the whole new &lt;br&gt;
&amp;gt; code to generate facets information.  Any helpful &lt;br&gt;
pointers &lt;br&gt;
&amp;gt; there?&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Many thanks,&lt;br&gt;
&amp;gt; Ashish&lt;br&gt;
&amp;gt; </description>
    </item>
    <item>
      <pubDate>Tue, 12 Jul 2011 12:03:09 -0400</pubDate>
      <title>Re: 3D surface recon from point cloud</title>
      <link>http://www.mathworks.com/matlabcentral/newsreader/view_thread/162898#845130</link>
      <author>developer </author>
      <description>&quot;Ashish A&quot; wrote in message &amp;lt;fnqvbu$mvm$1@fred.mathworks.com&amp;gt;...&lt;br&gt;
&amp;gt; Hello&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; I have been working on a project to do a surface &lt;br&gt;
&amp;gt; reconstruction from a point cloud.  I am writing my code &lt;br&gt;
&amp;gt; in Matlab and using the algorithm described by Hoppe et &lt;br&gt;
&amp;gt; al.  &lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Step 1: finding k neighbors and using principal component &lt;br&gt;
&amp;gt; analysis to find a center and a normal for the plane.&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Step 2: Orienting the normals: this is where I am having &lt;br&gt;
&amp;gt; some difficulty.  I am generating a Euclidean minimum &lt;br&gt;
&amp;gt; spanning tree in 3d based on the algorithm described at &lt;br&gt;
&amp;gt; wikipedia.  Basically, first calculating Delaunay &lt;br&gt;
&amp;gt; triangulation to calculate edges (distance between &lt;br&gt;
&amp;gt; points).  Then starting from the point with highest z, I &lt;br&gt;
&amp;gt; am using prim&#8217;s algorithm to generate the EMST.  Once, I &lt;br&gt;
&amp;gt; have the EMST, I am orienting the normal&#8217;s to point &lt;br&gt;
&amp;gt; outward.  &lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Step 3:  Surface Contouring:  I am planning to use the &lt;br&gt;
&amp;gt; marching cube algorithm but haven&#8217;t written the code yet.&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; The step 2 seems to work fine for small set of data points &lt;br&gt;
&amp;gt; (sample data points up to 100-200) but when I try it with &lt;br&gt;
&amp;gt; the actual data set (~20000 points), it seems to take it &lt;br&gt;
&amp;gt; forever.  I have let it run for over 8 hours without &lt;br&gt;
&amp;gt; getting any results.  Even if it is working, I don&#8217;t think &lt;br&gt;
&amp;gt; it is acceptable.  I am sure the surface contouring part &lt;br&gt;
&amp;gt; will be computationally long as well.  So, my question is &lt;br&gt;
&amp;gt; that are there any tricks that other have been using for &lt;br&gt;
&amp;gt; orienting the normals of the tangent planes.  Or are there &lt;br&gt;
&amp;gt; any already existing functions for this?&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; My other question is about surface contouring.  I feel &lt;br&gt;
&amp;gt; confident that if I can get the normal orientation right, &lt;br&gt;
&amp;gt; I should be able to do this by a brute force marching cube &lt;br&gt;
&amp;gt; algorithm.  But, I would like to use the iso-surface &lt;br&gt;
&amp;gt; function of the matlab instead of writing the whole new &lt;br&gt;
&amp;gt; code to generate facets information.  Any helpful pointers &lt;br&gt;
&amp;gt; there?&lt;br&gt;
&amp;gt; &lt;br&gt;
&amp;gt; Many thanks,&lt;br&gt;
&amp;gt; Ashish&lt;br&gt;
&amp;gt; &lt;br&gt;
Hello, &lt;br&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;Friend i need to do the same thing ,is it possible to contact u , actually i am trying to do somewhat the same thing but i am a beginer in this . so if its possible assist me i will be thankful </description>
    </item>
  </channel>
</rss>

