A number of you have asked about getting point cloud out of Photosynth, and the clever binarymillenium has reverse-engineered how to parse it out! We should make the following caveats: a) binarymillenium isn’t connected with Microsoft in any way (as far as we know :), and b) the format isn’t yet documented or supported (we’re working on it), so we can’t yet guarantee that it’ll be stable. But I’m sure there will be readers eager to try this out.
So, it’s Peter (on the Photosynth team), who ran across the following wonderful piece of work.

The pictures can be toggled off with the ‘p’ key, and the viewing experience is much improved given there is a good point cloud underneath. But what use is a point cloud inside a browser window if it can’t be exported to be manipulated into random videos that could look like all the lidar videos I’ve made, or turned into 3D meshes and used in Maya or any other program?
Read more →

In this article will present some information about VRMesh Studio, point cloud software by Virtual Grid Company.

At first, it allows to import numerous file formats. And although I have encountered other software that had richer set, this one also looks quite sufficient for work in this sphere.

Studio has possibilities to reconstruct and manipulate point-cloud. It’s also capable of geometry modification. This is titled as “Reverse Engineering”, but unfortunately this point cloud software doesn’t output data in a form of NURBS surfaces.

Read more →

Our world has the shape of 3D, so a detailed quantitative 3D analysis, modeling and visualization need to be provided in order to represent it as accurately as it is possible. Even such methods data as airborne and spaceborne imaging acquire from a downward angle. Every detail seen from the ground is still important, but providing data under overhangs, roofs and bridges at higher resolution and accuracy than airborne methods.

Such characteristics as more effective and realistic size, volume, orientation and other properties are obtained better with the help of photorealistic 3D data. Also, it gives the opportunity to demonstrate the results gained virtually in 3D visualization systems as well as the integration with other digital info. Every small detail’s location, such as of rock cliff or a brick, creates a 3D photorealistic virtual model effectively, with a high-resolution digital photo.

Read more →

A point cloud is a set of vertices in a three-dimensional coordinate system. These vertices are usually defined by X, Y and Z coordinates.

Uses of a point cloud

3D scanners work is one of the most popular and known way to get a point cloud. The cloud is output as a seperate data file after being measured as a large number of points on the object’s surface. The point cloud represents the visible surface of the object that has been scanned or digitized.
Read more →

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 a barcode for a given PCD. We illustrate the feasibility of our methods by applying them for classification and parametrization of several families of shape PCDs with noise. We also provide an effective metric for comparing shape barcodes for classification and parametrization. Finally, we discuss the limitations of our methods and possible extensions. An important property of our methods is that they are applicable to any curve PCD without any need for specialized knowledge about the curve. The salient feature of our work is its reliance on theory, allowing us to extend our methods to shapes in higher dimensions,such as families of surfaces embedded in R3 where we utilize higher-dimensional barcodes.

Our work suggests a number of enticing research directions:

_� Implementing density estimation techniques to remove spurious components arising from noise,

_� A systematic study of the thickness problem of scanned curves,

_� Implementing the strategy for identifying boundary points,further strengthening our method,

_� Applying our methods to surface point cloud data.

Read more →

Predictive Point-Cloud Compression

Stefan Gumhold∗ Zachi Karni Martin Isenburg Hans-Peter Seidel

MPI f¨ur Informatik Saarbr¨ucken

Read more →

In this section,we discuss the application of our work to shape parametrization and classification. We have implemented a complete system for computing and visualizing filtered tangent complexes,and for computing,displaying,and comparing barcodes.

Read more →

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 this section, we characterize several such phenomena. For each problem,we describe possible solutions that are restrictions of methods that work in arbitrary dimensions. In

Read more →

Our first family of spaces are ellipses given by the equation ^x_a2 ² _þ^y_b² 2 _¼ 1: We compute PCDs for the five ellipses shown in Fig. 4 with semi-major axis a _¼ 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 o bottom . T o generat e th e poin t sets,w e selec t 5 0 point s pe r uni t lengt h space d evenl y alon g th e x -an d y -axis,an d the n projec t thes e sample s ont o th e tru e curve . Therefore,th e point s ar e roughl y D x _¼ 0: 0 2 apart . W e the n ad d Gaussia n nois e t o eac h poin t wit h mea n 0 an d standar d deviatio n equa l t o hal f th e inter-poin t distanc e o r 0.01 . Fo r ou r metric,w e us e a scalin g facto r o _¼ 0: 1 : T o determin e a n appropriat e valu e fo r � fo r computin g th e Rip s complex,w e utiliz e ou r rule-of thumb : Eq . (2 ) fro m Sectio n 3.2 . Th e maximu m curvatur e fo r th e ellipse s show n i s kmax _¼ 50; so

0: 0 2 1 _þ 5 ² =2 0: 05 : Thi s valu e successfull y connect s point s wit h clos e basepoint s an d tangen t directions , whil e stil l keepin g antipoda l point s i n th e individua l fiber s separated .

Read more →

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 ² : Before we comput e the barcode,we need to construct the tangent complex . Since we only have samples from the original space,we can only approximate the tangent complex . We begin by computing a new PCD , p ¹_ð P_Þ T_ð X _Þ ; that sample s the tangen t comple x fo r ou r shape . T o captur e it s homol ogy,w e firs t approximat e the underlyin g spac e an d the n comput e a simplicia l comple x tha t represent s it s connectivity . W e filte r thi s comple x b y estimatin g the curvatur e a t eac h poin t o f p ¹_ð P_Þ : We conclude this section by describing the barcode computation and giving an algorithm for computing the metric on the barcode space.

Read more →