<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>Point cloud</title>
	<link>http://pointcloud.net</link>
	<description>Software driven point cloud manipulation</description>
	<pubDate>Tue, 29 Jul 2008 13:31:01 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
	<language>en</language>
			<item>
		<title>Conclusion (Part 7)</title>
		<link>http://pointcloud.net/conclusion-part-7/</link>
		<comments>http://pointcloud.net/conclusion-part-7/#comments</comments>
		<pubDate>Thu, 24 Jul 2008 19:23:21 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/conclusion-part-7/</guid>
		<description><![CDATA[In this paper we apply ideas of our earlier paper to provide novel methods for studying the qualitative properties of one-dimensional spaces in the plane [18] . Our method is based on studying the connected components of a complex constructed from a curve using its tangential information. Our method generates a compact shape descriptor called [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/conclusion-part-7/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Predictive Point-Cloud Compression</title>
		<link>http://pointcloud.net/predictive-point-cloud-compression/</link>
		<comments>http://pointcloud.net/predictive-point-cloud-compression/#comments</comments>
		<pubDate>Mon, 21 Jul 2008 13:19:10 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/predictive-point-cloud-compression/</guid>
		<description><![CDATA[Predictive Point-Cloud Compression
Stefan Gumhold&#8727; Zachi Karni Martin Isenburg Hans-Peter Seidel
MPI f&#168;ur Informatik Saarbr&#168;ucken

]]></description>
		<wfw:commentRss>http://pointcloud.net/predictive-point-cloud-compression/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Applications (Part 6)</title>
		<link>http://pointcloud.net/applications-part-6/</link>
		<comments>http://pointcloud.net/applications-part-6/#comments</comments>
		<pubDate>Fri, 18 Jul 2008 10:19:27 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/applications-part-6/</guid>
		<description><![CDATA[In this section,we discuss the application of our work to shape parametrization and classiﬁcation. We have implemented a complete system for computing and visualizing ﬁltered tangent complexes,and for computing,displaying,and comparing barcodes.
]]></description>
		<wfw:commentRss>http://pointcloud.net/applications-part-6/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Extensions (Part 5)</title>
		<link>http://pointcloud.net/extensions-part-5/</link>
		<comments>http://pointcloud.net/extensions-part-5/#comments</comments>
		<pubDate>Thu, 17 Jul 2008 22:15:28 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/extensions-part-5/</guid>
		<description><![CDATA[In Section 3,we assumed that our PCD was sampled from a closed smooth curve in the plane. Our PCDs in the last section,however,violated our assumption as both families had added noise,and the family of cubics featured boundary points. Our method performed quite well,however,and naturally,we would like our method to generalize to other misbehaving PCDs. In [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/extensions-part-5/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Family of ellipses (part 4)</title>
		<link>http://pointcloud.net/family-of-ellipses-part-4/</link>
		<comments>http://pointcloud.net/family-of-ellipses-part-4/#comments</comments>
		<pubDate>Thu, 17 Jul 2008 02:02:59 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/family-of-ellipses-part-4/</guid>
		<description><![CDATA[Our ﬁrst family of spaces are ellipses given by the equation xa2 2 &#254;yb2 2 &#188; 1: We compute PCDs for the ﬁve ellipses shown in Fig. 4 with semi-major axis a &#188; 0: 5 an d semi-mino r axe s b equa l t o 0.5,0.4,0.3,0.2,an d 0.1 , fro m to p t [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/family-of-ellipses-part-4/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A barcode shape descriptor for curve point cloud data: Computing barcodes (Part 3)</title>
		<link>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-computing-barcodes-part-3/</link>
		<comments>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-computing-barcodes-part-3/#comments</comments>
		<pubDate>Tue, 15 Jul 2008 19:50:57 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-computing-barcodes-part-3/</guid>
		<description><![CDATA[In this section,we present a complete pipeline for computing barcodes for a PCD . Throughout this section,we assume that our PCD P contains samples from a smooth closed curve X R 2 : Before we comput e the barcode,we need to construct the tangent complex . Since we only have samples from the original space,we [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-computing-barcodes-part-3/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Filtered simplicial complex and persistent homology for curve point cloud data (Part 2)</title>
		<link>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-2/</link>
		<comments>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-2/#comments</comments>
		<pubDate>Sun, 13 Jul 2008 14:31:09 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-2/</guid>
		<description><![CDATA[Part2
2.1. Filtered simplicial complex
Le t S b e a se t o f points . A k-simplex i s a subse t o f S o f siz e k &#254; 1 (19). A simplex may be realized geometrically as the convex hull of k &#254; 1 afﬁnely independent points in Rd ; dX k [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-2/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A barcode shape descriptor for curve point cloud data (Part 1)</title>
		<link>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-1/</link>
		<comments>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-1/#comments</comments>
		<pubDate>Sun, 13 Jul 2008 07:59:09 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-1/</guid>
		<description><![CDATA[&#160;
Computers &#38; Graphics 28 (2004) 881&#8211;894
a) Department of Mathematics, Stanford University, 450 Serra Mall, Bldg. 380, Stanford, CA 94305 2125, USA
b) Department of Computer Science, Stanford University, Stanford, CA 94305, USA
&#160;
Abstract
I n thi s paper,w e presen t a complet e computationa l pipelin e fo r extractin g a compac t shap e descripto [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/a-barcode-shape-descriptor-for-curve-point-cloud-data-part-1/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Point Cloud Data</title>
		<link>http://pointcloud.net/point-cloud-data/</link>
		<comments>http://pointcloud.net/point-cloud-data/#comments</comments>
		<pubDate>Sat, 12 Jul 2008 23:59:47 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/point-cloud-data/</guid>
		<description><![CDATA[Raw 3D digitized, or point cloud data, is memory hungry, static, and awkward. While it is possible to export raw data directly into CAD software, it can be very painful.  Software such as Imageware&#8217;s Surfacer&#169;, STRIM&#169;, Pro/Scan Tools&#169;, Alias Eval Viewer&#169;, or similar programs are vital. The following is a description of how software [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/point-cloud-data/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The modeling and visualization problem: conclusions (Last Part)</title>
		<link>http://pointcloud.net/the-modeling-and-visualization-problem-conclusions-last-part/</link>
		<comments>http://pointcloud.net/the-modeling-and-visualization-problem-conclusions-last-part/#comments</comments>
		<pubDate>Thu, 10 Jul 2008 05:43:14 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://pointcloud.net/the-modeling-and-visualization-problem-conclusions-last-part/</guid>
		<description><![CDATA[7. CONCLUSIONS
In this paper a description of all the processes to convert a measured point cloud into a polygonal surface and then visualize it with a computer has been presented. An almost complete overview of the modeling/visualization solutions has been reported, including also spline-based packages, but many other solutions are probably implemented in various labs [...]]]></description>
		<wfw:commentRss>http://pointcloud.net/the-modeling-and-visualization-problem-conclusions-last-part/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
