Fan-Meshes: A Geometric Primitive for Point-based Description of 3D Models and Scenes
|
|
- Tamsyn Bailey
- 6 years ago
- Views:
Transcription
1 Fan-Meshes: A Geometric Primitive for Point-based Description of 3D Models and Scenes Xiaotian Yan, Fang Meng, Hongbin Zha National Laboratory on Machine Perception Peking University, Beijing, P. R. China {yanxt, mengfang, zha}@cis.pku.edu.cn Abstract We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approximation to the data geometry, and can serve as primitives in reconstruction with a good balance between computational loads and reconstruction quality. In our algorithm, local remeshing is performed in preprocessing to obtain regular FMs, and a three-levelpoint data structure called Triangle Selection Record (TSR) is then used to reduce redundancies in the raw data and overlapping in the original FMs. Furthermore, to apply the method to raw 3D scanning data, we use a smoothing operator to the point cloud in order to eliminate some sensor noises. Experimental results demonstrate that our scheme is effective even for largescale scenes with real data. 1. Introduction Reconstruction of 3D models and scenes is an important process in robot vision, digital heritage and virtual reality [1]. With advances in 3D sensing methods, more and more reconstruction systems are based on dense 3D point clouds obtained by using such technologies [2, 3]. In traditional geometry-based reconstruction pipelines, first we have to perform global triangulation on the original point clouds for the subsequent processes, such as feature extraction, scene description and rendering. However, the global triangulation itself is very timeconsuming, and in some cases where a huge dataset has to be handled, it may become completely unacceptable for current PC hardware. Moreover, since the raw data usually contains many noises and holes due to occlusion, the resulting triangular meshes may have large topological errors, which will make the final reconstructed result unreliable. Using 3D points directly as primary primitives for reconstruction is an effective solution to the above problems [4]. In fact, some new algorithms on rendering and point-based model transmission [5, 6] have been proposed recently in the fields of computer graphics and 3D modeling. However, the methods have drawbacks in dealing with problems such as: How to simplify data clouds directly by local shapeadaptive decimation controlled by some approximation error bounds. How to explicitly represent the adjacency relationship between points without global meshing. In order to solve the problems, we propose in the paper a novel geometric primitive, called Fan-Meshes (FM), for locally approximating surfaces in 3D pointsampled models with piecewise linear approximation functions. It has much more flexibility in describing surfaces of complex shapes than other simple primitives such as planes or spheres [4, 6]. At the same time, by using a data arrangement process prior to the on-line reconstruction, we can reduce the computational costs that are usually high for complex primitives [7]. We can also decrease the data redundancies by utilizing a local remeshing technique to make each FM to have largest coverage on the surfaces. To eliminate some sensor noises in a raw data set, we apply a local smoothing operator to the point cloud as a basic pre-processing step. Moreover, since the point-based reconstruction scheme relies only on local adjacency relationships between points, we can partition a large point cloud into pieces and then merge them together easily after processing each piece respectively. These advantages together will lead to a good trade-off among the computational costs, space storage and reconstruction effects. Experimental results will show the applicability of our primitives to the reconstruction of 3D models and large natural scenes with real scanning point clouds. 2. Conceptual overview Our system takes as input unorganized point-clouds without any connectivity information. The system is composed of two main parts: data organization and pointbased description. The first part deals with the input data and creates FMs based on local piecewise linear approximation to the data geometry. At first, a discrete Laplacian smoothing operator [11,12] is applied to point clouds for eliminating the measuring errors occurred while scanning. Local remeshing of triangles and FMs is
2 used to reorganize the local meshes in order to get regular distribution over the model surfaces. The second part uses a new data structure, called Triangle Selection Record (TSR), to decimate redundant triangles and decrease overlaps on model surfaces. 3. FM s creation At first, the definition of FM is given in this section. Then we explain in detail the FM s generation process which consists of three steps: selecting center points, searching its K-nearest neighbors and organizing the neighbors Definition of FM We use the term FM to define a new kind of geometric primitives in our description scheme. It consists of three components: a center point, its neighbor points and the connection relationship among these points. In the process of data organization, for a given point P 0, we compute its K-nearest neighbors P 1, P 2,, P K under the condition that all the neighbors should be distributed around P 0. P 0 will be referred to as the center point in the following sections. Then we order this neighbor points to make sure that the polygon P 1 P 2 P K is convex. We connect P 0 with P 1, P 2,, P K respectively and form a local mesh that we called a FM. It can describe local geometric properties around P 0 with K triangles incident to the point Selection of center points There exist many crossovers among FMs if we build the FM for every input point [7]. Considering that the neighborhoods of many points are already covered by other FMs, we need only treat parts of input data as center points which are used in building FMs. Weather a point can be regarded as a center point depends on the number of edges that connect to it. In the computation of K-nearest neighbors for a point P 0, it is desirable to find K neighbors surrounding P 0. Based on analysis of the rendering process for fan-meshes, it is obvious that if a point P i appears as a center point, K edges will be added to it. If it appears as a neighbor point, the number of added edges will vary between one and three. Therefore we stipulate that a point should not be used as a center point if it has been used (K-2) times as a neighbor point. According to this rule, some points are left out in this step, which can reduce both the computational time and storage space in our scheme. In our experiments, only less than 70% of the input points need to be used in the computation of K-nearest neighbors. Further analysis on connection information among fan-meshes and geometric properties over the model surfaces will decrease this percentage further to a lower level Searching the K-nearest neighbors A new algorithm for searching the K-nearest neighbors is developed with O(nlogn). The basic idea is that if a point is in the neighborhood of a center point P 0, its coordinates of XYZ axes are also in the neighborhood of P 0 s coordinates respectively. At first, we create three index tables to store respectively 3D coordinates of input points in increasing order, and hence the searching of neighbors for a point can be limited to local areas. Since points within the point-cloud models are dense with even distribution, we can form the searching subset quickly by selecting a certain number of points whose coordinates are adjacent to the corresponding coordinates of P 0 in the tables. Then we compute the distances from every point in the subset to P 0 and array them in increasing order. The first K points are the neighbors we need Neighbors organization After the K-nearest neighbors computation for a given center point, we must organize the neighbor points to ensure that they can construct a convex polygon. First we compute the best fitting plane F of a center point and its neighbors. As has been demonstrated in earlier work [8], the normal of F is the eigenvector corresponding to the minimal eigenvalue of the points covariance matrix C. Since the covariance matrix C is a 3 3 matrix, we can use the Cardano s equation [13] to compute the eigenvector quickly. After getting the best fitting plane F we project all points into it and denote their projections as Q 0, Q 1 Q K. We permute the indices of P 1, P 2 P K such that their projections form increasing angles Ai = Q 1 Q 0 Q i. In this order the points P i form a convex polygon. 4. Local remeshing We define a regular fan-mesh as follows: the center point P 0 lies in the center of the fan-mesh and triangles within the fan-mesh are approaching regular triangles, i.e. equilateral triangles. In our system, a triangle is a regular one only if each internal angle is between 30 and 135. Regular triangles and meshes are preferred in 3D modeling because they can describe the model surfaces smoothly and represent the object with better visual quality. However, we may get some irregular FMs because of the incomplete search of the neighbors or wrong selection of the best fitting plane in the processes
3 above. In order to improve the effect of the reconstruction, we perform the local remeshing process which can be divided into two parts: one is to deal with the triangle that has an internal angle less than 30 degrees by remeshing within a FM, and the other is to handle the triangle with an internal angle beyond 135 degrees by adjusting neighbors for a FM. Since our goal is to apply our method directly to raw scanning data, we also have to use some techniques to eliminate sensor noises before these processes Smoothing With the help of current 3D scanners, we can obtain models with high resolutions, which can record the objects accurately. However, there are some measuring errors which can lead to distortion. To eliminate such errors, we apply a local smoothing operator to the point clouds. A well-known smoothing operator for triangle meshes is the discrete Laplacian smoothing operator which moves a single point P 0 to the centroid Pi / K( i 1,2... K) of its 1-ring formed by the points P 1, P 2,, P K. We replace the 1-rings by the neighborhoods and then apply it to our point clouds. also on the geometry. To get good adaptability to detailed changes in raw data, we integrate their methods together and the effects of smoothing is shown in Figure 1(b), which is the smoothed result of Figure 1(a) Remeshing within a FM As the input point-cloud is dense with even distribution, the distances from the neighbors to the center point seem to be equal. It is obvious that the triangles in FMs are isosceles triangles approximately, and hence we need only to consider about the vertex angle, i.e. the angle with the vertex of the center point. Figure 2. Remeshing for getting regular triangles Figure 2 illustrates the process of remeshing for transforming irregular triangles into regular ones. Since P 2 P 0 P 3 is less than 30 degrees in Figure 2(a), we delete P 3 from the neighbor sequence and permute the indices of P 1, P 2,,P 6 which is illustrated in Figure 2(b) Adjusting neighbors for a FM Sometimes, the neighbor points can not enclose the center point P 0. At the same time, we notice that visual effects will be deteriorated if the vertex angle of a triangle is too big. Therefore it is required that the vertex angle should be less than 135 degrees. The local remeshing for the FMs is given as follows: Figure 1. Effects of the smoothing operator Taubin [11] made further investigation and found that this Laplacian smoothing operator causes shrinkage if it is applied to every vertex of a mesh. Guskov [12] added a coefficient to each point P i when they are summed, and the coefficients not only depend on the connectivity but Figure 3. Adjusting the neighborhood for a regular FM As shown in Figure 3(a), when P 4 P 0 P 5 is larger than 135 degrees, the most possible reason is that the point density varies sharply around P 0. The neighbors have to be adjusted with an insert-criterion. We select the 6 th neighbor P 6 and see whether P 4 P 0 P 6 and P 6 P 0 P 5 are regular. If P 6 meets the criterion we insert it and permute the neighbor sequence which is illustrated in Figure 3(b), or we consider the further next neighbor till the insert-criterion is met or a certain threshold number of neighbors has been reached.
4 We apply our scheme on a hematite model with points. Figure 5(b) and Figure 5(c) illustrate the results of the edges before and after local meshing respectively, contained in the box in Figure 5(a). We can observe that the edge of the surface becomes smooth and the visual effects are improved. 5. Point-based description Figure 4. Rebuilding the best fitting plane When the insert-criterion can not be satisfied in the step above, we assume that P 0 lies on a sharp edge of the surface. In this situation we will get the wrong best fitting plane and incorrect connection order of the neighbors. As shown in Figure 4, if we follow the projections order which is computed in the initial best fitting plane F 1 we can not get a regular FM. However, we can get a regular fan-mesh when using the plane F 2 to compute the connection order. Here the normal of F 2 is the eigenvector corresponding to the maximal eigenvalue of the covariance matrix C. By doing so, we rebuild the best fitting plane and permute the neighbor sequence. If the rebuilding step fails, we assume that P 0 lies on the boundary of the surface and use the neighbor sequence we compute originally. In the process of data organization, we reduce the computational loads by selecting parts of input points in building fan-meshes. However, there still exist much redundancies and overlaps among FMs. Therefore, to further simplify the model description, we propose a data structure, called Triangle Selection Record (TSR). With the help of TSRs, we can eliminate the redundancies and judge whether or not a triangle should be removed for decreasing topological errors. This process is called optimization analysis. TSR is a three-level-point data structure to record triangles that have been used in the creation of FMs. Nodes in TSRs represent vertices of triangles with its serial number and are arranged into three levels in our scheme. Node in first level records the first vertex of a triangle, and it has only one pointer to its child, the second vertex of the triangle; nodes in second level record the second vertices of triangles, and it has two pointers, one to its child, the other to the second vertices of other triangles; nodes in third level represent the third vertices of triangles, and it has only one pointer to its neighbors, the third vertices of other triangles. Figure 5. Effects of local remeshing (a) (b) Figure 6. Creation of a TSR Redundancies and overlaps always appear among adjacent FMs. Figure 6(b) demonstrates a TSR that records three triangles: {P 0, P 1, P 2 }, {P 0, P 3, P 4 } and {P 0, P 1, P 3 } among adjacent FMs in Figure 5(a). It works as follows: for any triangle {P x, P y, P z }, we first array its vertices by its serial number in increasing order, for example: P x P y P z, Then, we search the first vertex of the triangle in TSRs. If there has no matching record, we built a new TSR for this triangle; if there has a TSR with root node being P x, we compare the vertex P y with its nodes in the second level. A new node is inserted into this level if there has no node being P y ; otherwise we begin the next comparison for the third vertex P z. Since every
5 point has a unique serial number while reading from input data, we can eliminate redundancies naturally in the process of the TSRs creation. Moreover, based on the fact that overlapping triangles, for example {P 0, P 1, P 2 } and {P 0, P 1, P 3 } showed in Figure 6(a), share common nodes in the first-level and second-level in the TSR, we can skip the process for triangle {P 0, P 1, P 3 } if point P 2 and P 3 locate in the same way with respect to the edge P 0 P 1. Since it would cost considerable computational time and storage space to finish this work, and in fact, overlaps in our rendering scheme do not affect the visual quality seriously, we did not complete the elimination process for all overlaps in current scheme. 6. Results of experiments We apply our scheme on some models and two demos are shown in this section. Figure 8 shows a piece of a nose model with 300 points. As compared with the original model in Figure 8(a), our fan-meshes do not result in a continuous surface. However, as shown in Figure 8(b), we can achieve almost the same visual effects. Figure 7. Effects of optimization analysis We use a horse model with points to illustrate the effects of optimization analysis. Figure 7(a) illustrates the whole model and the area that is magnified in Figure 7(b) and (c). We can observe that the burrs in Figure 7(b) disappear in Figure 7(c) after the optimization analysis. About 15% of the triangles are reduced in this process. Figure 8. The property of fan-meshes The time-complexity of our scheme is O(nlogn). Table 1 shows the running times compared with the triangulation of point-clouds using Delaunay tetrahedrizations [10]. Since input data are dense scanning point clouds, Delaunay method is hard to perform the reconstruction and visualization for whole models. On the other hand, since our method just use localized process for some selected points, even huge point sets can be reconstructed easily. Table 1. Running time Method Computer Points Time PC with s Our AMD s scheme 1.8GHz s SGI s Delaunay Indigo min Extreme min
6 To illustrate the efficiency of our scheme in particular for huge models, we test our algorithm on point-cloud data from scanning the Yungang Grottos in China directly by a 3D laser scanner. The dataset contains 2,981,168 points after registration. We cut it into seven pieces, each of them has 100 thousands to 600 thousands points and the computational time varies from 3 minutes to 20 minutes. Figures 9(a), 9(b), 9(c) and 9(d) are four pieces of the model with the number of points and the running time given below. After eliminating the duplicates and overlaps, the number of triangles is between 2.5 and 4 times of the points. A significant feature of the point-based method is its easiness in merging different data pieces together. For a large model, we can partition it into several pieces and do the local meshing with each of them. Then, the whole model is represented just by aligning them together without any special processing for the piece stitching, which is usually very difficult for mesh models. The whole model merged by those pieces is illustrated in Figure 10(a) and 10(b). Our scheme may fail when the density of point clouds is too low or it varies too sharply. However, it is suitable for real data acquired by 3D laser scanners, where the point clouds are dense. 7. Conclusions In this paper, we proposed a data structure FM as primitives for point-based reconstruction of 3D models and scenes. Though the concept of FM is very simple, it is a good idea to realize localized analysis for huge point sets. It is designed based on local piecewise linear surface approximation, which can balance the computational loads and description performance. Compared with the traditional modeling, the method can achieve similar visual effects without the global triangulation process. Moreover, there is no necessity for recording connectivity information among primitives, which makes it more appropriate for huge point-cloud models. In the future, we will investigate deeply into the geometric properties over the model surfaces in order to optimally distribute FMs and reduce artifacts among those primitives. In addition, several other techniques, such as view-dependent level-of-detail description [9], will be incorporated into our scheme to improve the reconstruction quality. References [1] J. Hu, S. You, and U. Neumann, Approaches to Large-Scale Urban Modeling, IEEE Computer Graphics and Applications, Volume 23, Issue 6, 2003, pp [2] P. Allen, I. Stamos, A. Troccoli, etc., 3D Modeling of Historic Sites Using Range and Image Data, IEEE Int. Conf. on Robotics & Automation, 2003, pp [3] C. Früh and A. Zakhor, "Automated Reconstruction of Building Facades for Virtual Walk-thrus", SIGGRAPH, Sketches and Applications, [4] M. Gross, H. Pfister and M. Zwicker, Point-Based Computer Graphics, Eurographics Tutorial T6, [5] F. Meng and H. Zha, Streaming Transmission of Point-Sampled Geometry Based on View-Dependent Level-of-Detail, Proc. Fourth Int. Conf. on 3-D Digital Imaging and Modeling, 2003, pp [6] S. Rusinkiewicz and M. Levoy Streaming QSplat: A Viewer for Networked Visualization of Large, Dense Models, Proc. Symposium on Interactive 3D Graphics, 2001, pp [7] L. Linsen, Point-cloud Representation, Technical Report, Faculty of Computer Science, University of Karlsruhe, [8] M. Pauly, M. Gross and L. P. Kobbelt, Efficient Simplification of Point-Sampled Surface, Proc. IEEE Visualization, 2002, pp [9] D. Luebke, D. Cohen, R. Heubner, etc., Advanced Issues In Level Of Detail, SIGGRAPH Course Notes, [10] R. Mencl and H. Müller, Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets, Proc. of Computer Graphics International 98, 1998, pp [11] G. Taubin, A Signal Processing Approach to Fair Surface Design, Computer Graphics Proceedings, Annual Conf. Series, 1995, pp [12] I. Guskov, W. Sweldens, P. Schroder, Multiresolution Signal Processing for Meshes, SIGGRAPH 99, 1999, pp [13] M. Kline, Mathematical Thought from Ancient to Modern Times, Oxford University, Oxford, Acknowledgement We would like to acknowledge the helpful discussions with Dr. Hong Liu. The work was supported in part by the NSFC grant (No ).
7 (a) (b) (c) (d) Figure 9. Scene description for Yungang Grottos: (a) middle part of the tower: 124,994 points / processing time: 3 minutes; (b) a wall of the grotto: 572,050 points / processing time: 15 minutes; (c) bottom part of the tower: 169,995 points / processing time: 4 minutes; (d) frontispiece of the grotto: 327,379 points / processing time: 9 minutes.
8 (a) (b) Figure 10. (a) The whole model from viewpoint one; (b) The whole model from another viewpoint.
An Easy Viewer for Out-of-core Visualization of Huge Point-sampled Models
An Easy Viewer for Out-of-core Visualization of Huge Point-sampled Models Fang Meng, Hongbin Zha National Laboratory on Machine Perception, Peking University Beijing 100871, P. R. China {mengfang, zha}@cis.pku.edu.cn
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationSurface Reconstruction. Gianpaolo Palma
Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationMesh Repairing and Simplification. Gianpaolo Palma
Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 15 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationOutline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationPoint-based Simplification Algorithm
Point-based Simplification Algorithm Pai-Feng Lee 1, Bin-Shyan Jong 2 Department of Information Management, Hsing Wu College 1 Dept. of Information and Computer Engineering Engineering, Chung Yuan Christian
More informationA Global Laplacian Smoothing Approach with Feature Preservation
A Global Laplacian Smoothing Approach with Feature Preservation hongping Ji Ligang Liu Guojin Wang Department of Mathematics State Key Lab of CAD&CG hejiang University Hangzhou, 310027 P.R. China jzpboy@yahoo.com.cn,
More informationOverview. Efficient Simplification of Point-sampled Surfaces. Introduction. Introduction. Neighborhood. Local Surface Analysis
Overview Efficient Simplification of Pointsampled Surfaces Introduction Local surface analysis Simplification methods Error measurement Comparison PointBased Computer Graphics Mark Pauly PointBased Computer
More information3D Modeling Using Planar Segments And Mesh Elements. Gene Yu and George Wolberg. City College / CUNY New York, NY 10031
3D Modeling Using Planar Segments And Mesh Elements Ioannis Stamos Dept. of Computer Science Hunter College / CUNY New York, NY 10021 istamos@hunter.cuny.edu Gene Yu and George Wolberg Dept. of Computer
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationTriangular Mesh Segmentation Based On Surface Normal
ACCV2002: The 5th Asian Conference on Computer Vision, 23--25 January 2002, Melbourne, Australia. Triangular Mesh Segmentation Based On Surface Normal Dong Hwan Kim School of Electrical Eng. Seoul Nat
More informationGeometric Modeling and Processing
Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 4. Geometric Registration 4.1 Rigid Registration Range Scanning: Reconstruction Set of raw scans Reconstructed
More informationMinimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh
Minimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh Enkhbayar Altantsetseg 1) Katsutsugu Matsuyama ) Kouichi Konno ) 1) National University of Mongolia ) Iwate University {enkhbayar.a}
More informationPoint Cloud Streaming for 3D Avatar Communication
16 Point Cloud Streaming for 3D Avatar Communication Masaharu Kajitani, Shinichiro Takahashi and Masahiro Okuda Faculty of Environmental Engineering, The University of Kitakyushu Japan 1. Introduction
More informationParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of Triangular Meshes with Virtual Boundaries Yunjin Lee 1;Λ Hyoung Seok Kim 2;y Seungyong Lee 1;z 1 Department of Computer Science and Engineering Pohang University of Science and Technology
More informationManipulating the Boundary Mesh
Chapter 7. Manipulating the Boundary Mesh The first step in producing an unstructured grid is to define the shape of the domain boundaries. Using a preprocessor (GAMBIT or a third-party CAD package) you
More information3D Models from Range Sensors. Gianpaolo Palma
3D Models from Range Sensors Gianpaolo Palma Who Gianpaolo Palma Researcher at Visual Computing Laboratory (ISTI-CNR) Expertise: 3D scanning, Mesh Processing, Computer Graphics E-mail: gianpaolo.palma@isti.cnr.it
More informationCS 563 Advanced Topics in Computer Graphics QSplat. by Matt Maziarz
CS 563 Advanced Topics in Computer Graphics QSplat by Matt Maziarz Outline Previous work in area Background Overview In-depth look File structure Performance Future Point Rendering To save on setup and
More informationDigital Geometry Processing
Digital Geometry Processing Spring 2011 physical model acquired point cloud reconstructed model 2 Digital Michelangelo Project Range Scanning Systems Passive: Stereo Matching Find and match features in
More informationFACET SHIFT ALGORITHM BASED ON MINIMAL DISTANCE IN SIMPLIFICATION OF BUILDINGS WITH PARALLEL STRUCTURE
FACET SHIFT ALGORITHM BASED ON MINIMAL DISTANCE IN SIMPLIFICATION OF BUILDINGS WITH PARALLEL STRUCTURE GE Lei, WU Fang, QIAN Haizhong, ZHAI Renjian Institute of Surveying and Mapping Information Engineering
More informationAn Automatic Hole Filling Method of Point Cloud for 3D Scanning
An Automatic Hole Filling Method of Point Cloud for 3D Scanning Yuta MURAKI Osaka Institute of Technology Osaka, Japan yuta.muraki@oit.ac.jp Koji NISHIO Osaka Institute of Technology Osaka, Japan koji.a.nishio@oit.ac.jp
More information03 - Reconstruction. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Spring 17 - Daniele Panozzo
3 - Reconstruction Acknowledgements: Olga Sorkine-Hornung Geometry Acquisition Pipeline Scanning: results in range images Registration: bring all range images to one coordinate system Stitching/ reconstruction:
More informationFinal Project, Digital Geometry Processing
Final Project, Digital Geometry Processing Shayan Hoshyari Student #: 81382153 December 2016 Introduction In this project an adaptive surface remesher has been developed based on the paper [1]. An algorithm
More information3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment
3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment Özgür ULUCAY Sarp ERTÜRK University of Kocaeli Electronics & Communication Engineering Department 41040 Izmit, Kocaeli
More informationGeometry Processing & Geometric Queries. Computer Graphics CMU /15-662
Geometry Processing & Geometric Queries Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans,
More informationInteractive Collision Detection for Engineering Plants based on Large-Scale Point-Clouds
1 Interactive Collision Detection for Engineering Plants based on Large-Scale Point-Clouds Takeru Niwa 1 and Hiroshi Masuda 2 1 The University of Electro-Communications, takeru.niwa@uec.ac.jp 2 The University
More informationA DATA DRIVEN METHOD FOR FLAT ROOF BUILDING RECONSTRUCTION FROM LiDAR POINT CLOUDS
A DATA DRIVEN METHOD FOR FLAT ROOF BUILDING RECONSTRUCTION FROM LiDAR POINT CLOUDS A. Mahphood, H. Arefi *, School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran,
More informationApplications. Oversampled 3D scan data. ~150k triangles ~80k triangles
Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient
More informationA Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005
A Developer s Survey of Polygonal Simplification algorithms CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 Some questions to ask Why simplification? What are my models like? What matters
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationAn Algorithm of 3D Mesh Reconstructing Based on the Rendering Pipeline
3rd International Conference on Mechatronics and Information Technology (ICMIT 2016) An Algorithm of 3D Mesh Reconstructing Based on the Rendering Pipeline Zhengjie Deng1, a, Shuqian He1,b, Chun Shi1,c,
More informationLATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING
3D surface reconstruction of objects by using stereoscopic viewing Baki Koyuncu, Kurtuluş Küllü bkoyuncu@ankara.edu.tr kkullu@eng.ankara.edu.tr Computer Engineering Department, Ankara University, Ankara,
More informationing and enhancing operations for shapes represented by level sets (isosurfaces) and applied unsharp masking to the level set normals. Their approach t
Shape Deblurring with Unsharp Masking Applied to Mesh Normals Hirokazu Yagou Λ Alexander Belyaev y Daming Wei z Λ y z ; ; Shape Modeling Laboratory, University of Aizu, Aizu-Wakamatsu 965-8580 Japan fm50534,
More informationPoint based Rendering
Point based Rendering CS535 Daniel Aliaga Current Standards Traditionally, graphics has worked with triangles as the rendering primitive Triangles are really just the lowest common denominator for surfaces
More informationFeature Extraction for Illustrating 3D Stone Tools from Unorganized Point Clouds
Feature Extraction for Illustrating 3D Stone Tools from Unorganized Point Clouds Enkhbayar Altantsetseg 1) Yuta Muraki 2) Katsutsugu Matsuyama 2) Fumito Chiba 3) Kouichi Konno 2) 1) Graduate School of
More informationView-dependent Refinement of Multiresolution Meshes Using Programmable Graphics Hardware <CGI special issue>
The Visual Computer manuscript No. 642 (will be inserted by the editor) JUNFENG JI 1,3,4, ENHUA WU 1,2, SHENG LI 1,5, XUEHUI LIU 1 View-dependent Refinement of Multiresolution Meshes Using Programmable
More informationGenerating 3D Meshes from Range Data
Princeton University COS598B Lectures on 3D Modeling Generating 3D Meshes from Range Data Robert Kalnins Robert Osada Overview Range Images Optical Scanners Error sources and solutions Range Surfaces Mesh
More information3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University.
3D Computer Vision Structured Light II Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 Introduction
More informationON THE WAY TO WATER-TIGHT MESH
ON THE WAY TO WATER-TIGHT MESH Rui Liu, Darius Burschka, Gerd Hirzinger Institute of Robotics and Mechatronics, German Aerospace Center (DLR) Oberpfaffenhofen, 82234 Wessling, Germany. Rui.Liu@dlr.de KEY
More informationVolume Illumination and Segmentation
Volume Illumination and Segmentation Computer Animation and Visualisation Lecture 13 Institute for Perception, Action & Behaviour School of Informatics Overview Volume illumination Segmentation Volume
More informationMesh Decimation. Mark Pauly
Mesh Decimation Mark Pauly Applications Oversampled 3D scan data ~150k triangles ~80k triangles Mark Pauly - ETH Zurich 280 Applications Overtessellation: E.g. iso-surface extraction Mark Pauly - ETH Zurich
More informationReconstruction of complete 3D object model from multi-view range images.
Header for SPIE use Reconstruction of complete 3D object model from multi-view range images. Yi-Ping Hung *, Chu-Song Chen, Ing-Bor Hsieh, Chiou-Shann Fuh Institute of Information Science, Academia Sinica,
More informationGeometric Modeling and Processing
Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 6. Mesh Simplification Problems High resolution meshes becoming increasingly available 3D active scanners Computer
More informationOutline. Reconstruction of 3D Meshes from Point Clouds. Motivation. Problem Statement. Applications. Challenges
Reconstruction of 3D Meshes from Point Clouds Ming Zhang Patrick Min cs598b, Geometric Modeling for Computer Graphics Feb. 17, 2000 Outline - problem statement - motivation - applications - challenges
More informationA Two-Stage Algorithm for Planning the Next View From Range Images
A Two-Stage Algorithm for Planning the Next View From Range Images Miguel Angel García, Department of Computer Science Engineering Rovira i Virgili University Ctra. Salou s/n. 43006 Tarragona, Spain magarcia@etse.urv.es
More informationMesh Processing Pipeline
Mesh Smoothing 1 Mesh Processing Pipeline... Scan Reconstruct Clean Remesh 2 Mesh Quality Visual inspection of sensitive attributes Specular shading Flat Shading Gouraud Shading Phong Shading 3 Mesh Quality
More informationShape fitting and non convex data analysis
Shape fitting and non convex data analysis Petra Surynková, Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 186 7 Praha 8, Czech Republic email: petra.surynkova@mff.cuni.cz,
More informationMultiresolution Meshes. COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc.
Multiresolution Meshes COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc. Motivation Huge meshes are difficult to render store transmit edit Multiresolution Meshes! [Guskov et al.]
More informationScanning Real World Objects without Worries 3D Reconstruction
Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects
More informationThe Ball-Pivoting Algorithm for Surface Reconstruction
The Ball-Pivoting Algorithm for Surface Reconstruction 1. Briefly summarize the paper s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results?
More informationGeometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data
Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies
More informationLocal patch blind spectral watermarking method for 3D graphics
Local patch blind spectral watermarking method for 3D graphics Ming Luo 1, Kai Wang 2, Adrian G. Bors 1, and Guillaume Lavoué 2 1 Department of Computer Science, University of York, York YO10 5DD, UK 2
More informationMultiresolution Remeshing Using Weighted Centroidal Voronoi Diagram
Multiresolution Remeshing Using Weighted Centroidal Voronoi Diagram Chao-Hung Lin 1, Chung-Ren Yan 2, Ji-Hsen Hsu 2, and Tong-Yee Lee 2 1 Dept. of Geomatics, National Cheng Kung University, Taiwan 2 Dept.
More informationMass-Spring Based Point-Sampled Surface Modelling
Mass-Spring Based Point-Sampled Surface Modelling Zhixun Su, Xiaojie Zhou, Xiuping Liu, Fengshan Liu, Xiquan Shi Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, P.R.
More informationDesign Intent of Geometric Models
School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Auckland University 15th September 2004; Version 1.1 Design Intent
More informationManifold Parameterization
Manifold Parameterization Lei Zhang 1,2, Ligang Liu 1,2, Zhongping Ji 1,2, and Guojin Wang 1,2 1 Department of Mathematics, Zhejiang University, Hangzhou 310027, China 2 State Key Lab of CAD&CG, Zhejiang
More informationChapter 1. Introduction
Introduction 1 Chapter 1. Introduction We live in a three-dimensional world. Inevitably, any application that analyzes or visualizes this world relies on three-dimensional data. Inherent characteristics
More informationAlgorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College
Algorithms for GIS Spatial data: Models and representation (part I) Laura Toma Bowdoin College Outline Spatial data in GIS applications Point data Networks Terrains Planar maps and meshes Data structures
More informationModeling and Analyzing 3D Shapes using Clues from 2D Images. Minglun Gong Dept. of CS, Memorial Univ.
Modeling and Analyzing 3D Shapes using Clues from 2D Images Minglun Gong Dept. of CS, Memorial Univ. Modeling Flowers from Images Reconstructing 3D flower petal shapes from a single image is difficult
More informationSpectral Surface Reconstruction from Noisy Point Clouds
Spectral Surface Reconstruction from Noisy Point Clouds 1. Briefly summarize the paper s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results?
More informationAlgorithm research of 3D point cloud registration based on iterative closest point 1
Acta Technica 62, No. 3B/2017, 189 196 c 2017 Institute of Thermomechanics CAS, v.v.i. Algorithm research of 3D point cloud registration based on iterative closest point 1 Qian Gao 2, Yujian Wang 2,3,
More informationData Representation in Visualisation
Data Representation in Visualisation Visualisation Lecture 4 Taku Komura Institute for Perception, Action & Behaviour School of Informatics Taku Komura Data Representation 1 Data Representation We have
More information: Mesh Processing. Chapter 8
600.657: Mesh Processing Chapter 8 Handling Mesh Degeneracies [Botsch et al., Polygon Mesh Processing] Class of Approaches Geometric: Preserve the mesh where it s good. Volumetric: Can guarantee no self-intersection.
More informationA Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud
International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional
More informationMulti-Scale Free-Form Surface Description
Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,
More informationMesh and Mesh Simplification
Slide Credit: Mirela Ben-Chen Mesh and Mesh Simplification Qixing Huang Mar. 21 st 2018 Mesh DataStructures Data Structures What should bestored? Geometry: 3D coordinates Attributes e.g. normal, color,
More informationMULTI - RESOLUTION 3D MODEL BY LASER DATA
MULTI - RESOLUTION 3D MODEL BY LASER DATA E.S. Malinverni, G. Fangi, G. Gagliardini, DARDUS Università Politecnica delle Marche, Via Brecce Bianche, Ancona Italy malinverni@unian.it Commission V, WG V/4
More informationDigital Geometry Processing. Computer Graphics CMU /15-662
Digital Geometry Processing Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans, not fins
More informationCLASSIFICATION FOR ROADSIDE OBJECTS BASED ON SIMULATED LASER SCANNING
CLASSIFICATION FOR ROADSIDE OBJECTS BASED ON SIMULATED LASER SCANNING Kenta Fukano 1, and Hiroshi Masuda 2 1) Graduate student, Department of Intelligence Mechanical Engineering, The University of Electro-Communications,
More informationAlgorithms for GIS csci3225
Algorithms for GIS csci3225 Laura Toma Bowdoin College Spatial data types and models Spatial data in GIS satellite imagery planar maps surfaces networks point cloud (LiDAR) Spatial data in GIS satellite
More informationFast Surface Reconstruction and Segmentation with Terrestrial LiDAR Range Data by Matthew Carlberg. Research Project
Fast Surface Reconstruction and Segmentation with Terrestrial LiDAR Range Data by Matthew Carlberg Research Project Submitted to the Department of Electrical Engineering and Computer Sciences, University
More informationWatertight Planar Surface Reconstruction of Voxel Data
Watertight Planar Surface Reconstruction of Voxel Data Eric Turner CS 284 Final Project Report December 13, 2012 1. Introduction There are many scenarios where a 3D shape is represented by a voxel occupancy
More informationAUTOMATED 3D MODELING OF URBAN ENVIRONMENTS
AUTOMATED 3D MODELING OF URBAN ENVIRONMENTS Ioannis Stamos Department of Computer Science Hunter College, City University of New York 695 Park Avenue, New York NY 10065 istamos@hunter.cuny.edu http://www.cs.hunter.cuny.edu/
More informationLeast-squares Meshes. Olga Sorkine Tel Aviv University Daniel Cohen-Or Tel Aviv University Abstract.
Least-squares Meshes Olga Sorkine Tel Aviv University sorkine@tau.ac.il Daniel Cohen-Or Tel Aviv University dcor@tau.ac.il Abstract In this paper we introduce Least-squares Meshes: meshes with a prescribed
More informationUse of Shape Deformation to Seamlessly Stitch Historical Document Images
Use of Shape Deformation to Seamlessly Stitch Historical Document Images Wei Liu Wei Fan Li Chen Jun Sun Satoshi Naoi In China, efforts are being made to preserve historical documents in the form of digital
More informationStudy on Delaunay Triangulation with the Islets Constraints
Intelligent Information Management, 2010, 2, 375-379 doi:10.4236/iim.2010.26045 Published Online June 2010 (http://www.scirp.org/journal/iim) Study on Delaunay Triangulation with the Islets Constraints
More informationMesh Morphing. Ligang Liu Graphics&Geometric Computing Lab USTC
Mesh Morphing Ligang Liu Graphics&Geometric Computing Lab USTC http://staff.ustc.edu.cn/~lgliu Morphing Given two objects produce sequence of intermediate objects that gradually evolve from one object
More informationExtreme Simplification and Rendering of Point Sets using Algebraic Multigrid
Extreme Simplification and Rendering of Point Sets using Algebraic Multigrid Dennie Reniers Alexandru Telea Department of Mathematics and Computer Science Eindhoven University of Technology P.O. Box 513,
More informationCompression of 3D Objects with Multistage Color-Depth Panoramic Maps
Compression of 3D Objects with Multistage Color-Depth Panoramic Maps Chang-Ming Tsai 1,2, Wen-Yan Chang 1, Chu-Song Chen 1, Gregory Y. Tang 2 1 Institute of Information Science, Academia Sinica, Nankang
More informationContours & Implicit Modelling 1
Contouring & Implicit Modelling Visualisation Lecture 8 Institute for Perception, Action & Behaviour School of Informatics Contours & Implicit Modelling 1 Brief Recap Contouring Implicit Functions lecture
More informationParameterization of Meshes
2-Manifold Parameterization of Meshes What makes for a smooth manifold? locally looks like Euclidian space collection of charts mutually compatible on their overlaps form an atlas Parameterizations are
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationREFINEMENT OF COLORED MOBILE MAPPING DATA USING INTENSITY IMAGES
REFINEMENT OF COLORED MOBILE MAPPING DATA USING INTENSITY IMAGES T. Yamakawa a, K. Fukano a,r. Onodera a, H. Masuda a, * a Dept. of Mechanical Engineering and Intelligent Systems, The University of Electro-Communications,
More informationLine segment intersection. Family of intersection problems
CG Lecture 2 Line segment intersection Intersecting two line segments Line sweep algorithm Convex polygon intersection Boolean operations on polygons Subdivision overlay algorithm 1 Family of intersection
More informationFast K-nearest neighbors searching algorithms for point clouds data of 3D scanning system 1
Acta Technica 62 No. 3B/2017, 141 148 c 2017 Institute of Thermomechanics CAS, v.v.i. Fast K-nearest neighbors searching algorithms for point clouds data of 3D scanning system 1 Zhang Fan 2, 3, Tan Yuegang
More information3D Reconstruction of Ancient Structures Assisted by Terrestrial Laser Scanning Technology
2nd International Forum on Management, Education and Information Technology Application (IFMEITA 2017) 3D Reconstruction of Ancient Structures Assisted by Terrestrial Laser Scanning Technology Li Xuefei
More informationHalf-edge Collapse Simplification Algorithm Based on Angle Feature
International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2015) Half-edge Collapse Simplification Algorithm Based on Angle Feature 1,2 JunFeng Li, 2 YongBo Chen, 3
More informationGeometric Modeling in Graphics
Geometric Modeling in Graphics Part 10: Surface reconstruction Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Curve, surface reconstruction Finding compact connected orientable 2-manifold surface
More informationExtraction of Concise and Realistic 3-D Models from Real Data *
Extraction of Concise and Realistic 3-D Models from Real Data * Andrew E. Johnson 1 Sing Bing Kang 2 Richard Szeliski 3 1 The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213 aej@ri.cmu.edu
More informationAdvanced 3D-Data Structures
Advanced 3D-Data Structures Eduard Gröller, Martin Haidacher Institute of Computer Graphics and Algorithms Vienna University of Technology Motivation For different data sources and applications different
More informationAutomatic generation of 3-d building models from multiple bounded polygons
icccbe 2010 Nottingham University Press Proceedings of the International Conference on Computing in Civil and Building Engineering W Tizani (Editor) Automatic generation of 3-d building models from multiple
More informationJoint Alignment and Stitching of Non Overlapping Meshes
Joint Alignment and Stitching of Non Overlapping Meshes Susana Brandão 1 and João P. Costeira 2 and Manuela Veloso 3 Abstract We contribute a novel algorithm for aligning and stitching non-overlapping
More informationFAST REGISTRATION OF TERRESTRIAL LIDAR POINT CLOUD AND SEQUENCE IMAGES
FAST REGISTRATION OF TERRESTRIAL LIDAR POINT CLOUD AND SEQUENCE IMAGES Jie Shao a, Wuming Zhang a, Yaqiao Zhu b, Aojie Shen a a State Key Laboratory of Remote Sensing Science, Institute of Remote Sensing
More informationTHE HALF-EDGE DATA STRUCTURE MODELING AND ANIMATION
THE HALF-EDGE DATA STRUCTURE MODELING AND ANIMATION Dan Englesson danen344@student.liu.se Sunday 12th April, 2011 Abstract In this lab assignment which was done in the course TNM079, Modeling and animation,
More informationSaab. Kyle McDonald. Polygon Meshes
Saab Kyle McDonald Polygon Meshes Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749 What is a polygon mesh? Like a point cloud, it is a discrete sampling of a surface... but, it adds linear (flat)
More informationFast and robust techniques for 3D/2D registration and photo blending on massive point clouds
www.crs4.it/vic/ vcg.isti.cnr.it/ Fast and robust techniques for 3D/2D registration and photo blending on massive point clouds R. Pintus, E. Gobbetti, M.Agus, R. Combet CRS4 Visual Computing M. Callieri
More informationCollision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering
RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE
More informationFEATURE-BASED REGISTRATION OF RANGE IMAGES IN DOMESTIC ENVIRONMENTS
FEATURE-BASED REGISTRATION OF RANGE IMAGES IN DOMESTIC ENVIRONMENTS Michael Wünstel, Thomas Röfer Technologie-Zentrum Informatik (TZI) Universität Bremen Postfach 330 440, D-28334 Bremen {wuenstel, roefer}@informatik.uni-bremen.de
More information