DOCSLIB.ORG

Make It Simpler Structure-Aware Mesh Decimation of Large Scale Models

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Make It Simpler Structure-Aware Mesh Decimation of Large Scale Models Master of Science Thesis in Electrical Engineering Department of Electrical Engineering, Linköping University, 2018 Make it Simpler Structure-aware mesh decimation of large scale models Daniel Böök Master of Science Thesis in Electrical Engineering Make it Simpler Structure-aware mesh decimation of large scale models Daniel Böök LiTH-ISY-EX–19/5192–SE Supervisor: Harald Nautsch isy, Linköpings universitet Mikael Hägerström Spotscale AB Examiner: Ingemar Ragnemalm isy, Linköpings universitet Division of Information Coding Department of Electrical Engineering Linköping University SE-581 83 Linköping, Sweden Copyright © 2018 Daniel Böök For Luna and Johanna Abstract A 3D-model consists out of triangles, and in many cases, the amount of triangles are unnecessarily large for the application of the model. If the camera is far away from a model, why should all triangles be there when in reality it would make sense to only show the contour of the model? Mesh decimation is often used to solve this problem, and its goal is to minimize the amount of triangles while still keep the visual representation intact. Having the decimation algorithm being structure aware, i.e. having the algorithm aware of where the important parts of the model are, such as corners, is of great benefit when doing extreme simplification. The algorithm can then decimate large, almost planar parts, to only a few triangles while keeping the important features detailed. This thesis aims to describe the development of a structure aware decimation algorithm for the company Spotscale, a company specialized in creating 3D-models of drone footage. v Acknowledgments I would like to thank everyone at Spotscale for giving me the opportunity to work at their office and being helpful with the addition of being great resources during this thesis. Also the examiner and the supervisor have been there and gave great insights during the development of the algorithm and writing this thesis. Finally, I would like to thank my family for being supportive and pushed me to do better when needed. Linköping, January 2019 Daniel Böök vii Contents 1 Introduction 1 1.1 Motivation . 1 1.2 Aim . 2 1.3 Research Questions . 2 1.4 Delimitations . 2 2 Background 3 2.1 Spotscale . 3 2.2 List of specification . 3 3 Related Work 5 3.1 Surface simplification . 5 3.1.1 Garland and Heckberts decimation algorithm . 5 3.1.2 Structure-Aware decimation . 6 3.2 Mesh Refinement . 6 4 Theory 9 4.1 Edge collapse . 9 4.2 Planar proxies . 10 4.3 Graph of proxies . 10 4.4 Error Quadrics . 10 4.4.1 Inner quadric . 11 4.4.2 Boundary quadric . 12 5 Method 13 5.1 Feasibility study . 13 5.1.1 Introduction to mesh simplification . 13 5.1.2 A search for libraries . 14 5.1.3 Metro - A way of comparing different algorithms . 15 5.2 Implementation . 15 5.2.1 Inner and Boundary quadrics . 15 5.2.2 Solving the problem with flipping normals . 16 5.2.3 Avoiding slivers and needles . 16 ix x Contents 5.2.4 Decimating with an error margin . 16 5.2.5 Vary the amount of simplification . 17 5.3 Evaluation . 17 6 Result 19 6.1 Feasibility study . 19 6.1.1 A tool for evaluating errors in a mesh . 19 6.1.2 The chosen library . 20 6.2 Implementation - The resulting application . 21 6.2.1 Decimating a model . 23 6.2.2 Decimating with error tolerance . 23 6.2.3 Varying the decimation . 25 6.3 Evaluation of the algorithm . 26 7 Discussion 31 7.1 Result . 31 7.1.1 The results from feasibility study . 31 7.1.2 The resulting application . 33 7.1.3 The structure-aware decimation algorithm . 33 7.2 Method . 33 7.2.1 The choice of library . 33 7.2.2 Decimating with an error tolerance . 34 7.2.3 Vary the amount of decimation . 34 7.2.4 Evaluation of the final algorithm . 34 7.3 Further work . 34 8 Conclusion 35 8.1 Aim . 35 8.2 Research questions . 35 Bibliography 37 1 Introduction This chapter contains a short motivation why this is a topic of interest, the aim of this thesis, research questions to be answered and delimitations. 1.1 Motivation Mesh decimation is a common processing step in polygon mesh processing. The aim of decimating a model is to lower the amount of triangles that the model is built upon. By having some input criterion(s), e.g. a target number of triangle faces or continue to decimate as long as an error is kept below a specific number, the model can be minimized to a smaller, more manageable size. By lowering the amount of triangles in a mesh and still keep the general structures of the model intact, a boost in performance can be achieved without being able to distinguish any difference between the original and the decimated model. Viewing a large 3D-model on a smart-phone or a tablet which do not have the same computing power as a desktop computer would not be possible or would be prohibitively slow if no simplification is done. Even when using a fast modern computer, a whole block of buildings would not be possible to show if each building consisted of millions of triangles. Here, decimation takes on the important role of reducing the number of triangles in the models down to a fraction while still keeping the structural integrity of the buildings. When simplifying a model, a difficulty is to preserve important details for that specific model. How does the algorithm know what is important and what to discard? Looking at buildings once again, the edges of the building is impor- tant to keep highly detailed or else the result will not resemble the original. On the other hand, finding large almost planar parts in the model and decimating these parts down to only a few triangles will save a lot of space. Having a mesh decimation algorithm that is aware of the geometry is something that is highly 1 2 1 Introduction desirable. 1.2 Aim This thesis aims to develop a mesh decimation algorithm for the company Spotscale. Spotscale specializes in converting drone footage, mainly of blocks and buildings, into 3D-models by using photogrammetry. In their current pipeline of creating a 3D model the mesh is decimated with little control of how the algorithm rec- ognizes surfaces or any other features in the model. As mentioned in section 1.1, when creating models out of buildings, corner detail is an important feature to preserve while larger, almost planar parts, can be decimated down to only a few triangles. This, along with a few more demands on the final algorithm is listed and more thoroughly explained in Chapter 2. 1.3 Research Questions The following research questions will be investigated and answered throughout this thesis: • Which library will be used as a starting point for implementing a decima- tion algorithm? • What is a good metric for comparing the error between a decimated model and the original model? • How does the final algorithm that this thesis result in hold up against other publicly available methods of decimation? 1.4 Delimitations This thesis aims at creating an algorithm that focuses on decimating 3D models of buildings, since these models is what Spotscale specifies in. The algorithm will be tested with 3D models provided by Spotscale. 2 Background This chapter contains background information of the thesis, the company where the thesis is conducted at and describes the list of specification given by the com- pany. 2.1 Spotscale Spotscale is a company that works in the realm of creating high quality 3D- models of buildings using photogrammetry and drone footage. In their pipeline of creating these models, there are a processing step of creating a lower quality model for LOD purposes. These models contains less triangles than the original, and for the building to still look good, the right triangles need to be discarded while the important triangles stay untouched by the decimation. The company wanted more control over how the decimation step in their pipeline was done, and with this thesis completed, hopefully they have something that they can use in production. 2.2 List of specification Before the thesis started, the company gave a list of specifications with impor- tant features that the final algorithm should fulfill. This list was used during the course of the thesis for reference of how far the project has come along. The spec- ification list below is not in any way written in a prioritized manner, although some points are more important than others to fulfill. • Vary the amount of decimation in different places in the mesh (on/off, but also by weight or some cost function based on classification, e.g. vegetation, building or vehicle). 3 4 2 Background • Decimate the mesh to a target number of faces. • Decimate the mesh that continue as long as it does not exceed an error mar- gin (in e.g. meters). • Avoid non-manifolds. • Take flat surfaces in consideration. (Spotscales already written plane detec- tion could be used). • Have other input in the decimation, such as maximum angle in a triangle to avoid slivers. • Have RAM usage and speed of calculation is not the focus, but should be with in reason (less than an hour for a big model with more than 3 million triangles). • The following points will be implemented if time is available: – Have the implementation use the point cloud (of which the mesh is built upon) in the decimation – Decimate with the texture so that it fits the new model.
Load more

Recommended publications
  • Studio Toolkit for Flexibles 14 User Guide
    Studio Toolkit for Flexibles 14 User Guide 06 - 2015 Studio Toolkit for Flexibles Contents 1. Copyright Notice.......................................................................................................................................................................... 4 2. Introduction.....................................................................................................................................................................................6 2.1 About Studio....................................................................................................................................................................... 6 2.2 Workflow and Concepts................................................................................................................................................. 7 2.3 Quick-Start Tutorial...........................................................................................................................................................8 3. Creating a New Bag.................................................................................................................................................................12 3.1 Pillow Bags........................................................................................................................................................................13 3.1.1 Panel Order and Fin vs. Lap Seals.............................................................................................................14 3.2 Gusseted Bags.................................................................................................................................................................15
    [Show full text]
  • Compression and Streaming of Polygon Meshes
    Compression and Streaming of Polygon Meshes by Martin Isenburg A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science. Chapel Hill 2005 Approved by: Jack Snoeyink, Advisor Craig Gotsman, Reader Peter Lindstrom, Reader Dinesh Manocha, Committee Member Ming Lin, Committee Member ii iii ABSTRACT MARTIN ISENBURG: Compression and Streaming of Polygon Meshes (Under the direction of Jack Snoeyink) Polygon meshes provide a simple way to represent three-dimensional surfaces and are the de-facto standard for interactive visualization of geometric models. Storing large polygon meshes in standard indexed formats results in files of substantial size. Such formats allow listing vertices and polygons in any order so that not only the mesh is stored but also the particular ordering of its elements. Mesh compression rearranges vertices and polygons into an order that allows more compact coding of the incidence between vertices and predictive compression of their positions. Previous schemes were designed for triangle meshes and polygonal faces were triangulated prior to compression. I show that polygon models can be encoded more compactly by avoiding the initial triangulation step. I describe two compression schemes that achieve better compression by encoding meshes directly in their polygonal representation. I demonstrate that the same holds true for volume meshes by extending one scheme to hexahedral meshes. Nowadays scientists create polygonal meshes of incredible size. Ironically, com- pression schemes are not capable|at least not on common desktop PCs|to deal with giga-byte size meshes that need compression the most.
    [Show full text]
  • Meshes and More CMSC425.01 Fall 2019 Administrivia
    Meshes and More CMSC425.01 fall 2019 Administrivia • Google form distributed for grading issues Today’s question How to represent objects Polygonal meshes • Standard representation of 3D assets • Questions: • What data and how stored? • How generate them? • How color and render them? Data structure • Geometric information • Vertices as 3D points • Topology information • Relationships between vertices • Edges and faces Vertex and fragment shaders • Mapping triangle to screen • Map and color vertices • Vertex shaders in 3D • Assemble into fragments • Render fragments • Fragment shaders in 2D Normals and shading – shading equation • Light eQuation • k terms – color of object • L terms – color of light • Ambient term - ka La • Constant at all positions • Diffuse term - kd (n • l) • Related to light direction • Specular term - (v • r)Q • Related to light, viewer direction Phong exponent • Powers of cos (v • r)Q • v and r normalized • Tightness of specular highlights • Shininess of object Normals and shading • Face normal • One per face • Vertex normal • One per vertex. More accurate • Interpolation • Gouraud: Shade at vertices, interpolate • Phong: Interpolate normals, shade Texture mapping • Vary color across figure • ka, kd and ks terms • Interpolate position inside polygon to get color • Not trivial! • Mapping complex Bump mapping • “Texture” map of • Perturbed normals (on right) • Perturbed height (on left) Summary – full polygon mesh asset • Mesh can have vertices, faces, edges plus normals • Material shader can have • Color (albedo) •
    [Show full text]
  • Notes on Polygon Meshes 1 Basic Definitions
    CMSC 23700 Introduction to Computer Graphics Handout 2 Autumn 2015 November 12 Notes on polygon meshes 1 Basic definitions Definition 1 A polygon mesh (or polymesh) is a triple (V; E; F ), where V a set of vertices (points in space) E ⊂ (V × V ) a set of edges (line segments) F ⊂ E∗ a set of faces (convex polygons) with the following properties: 1. for any v 2 V , there exists (v1; v2) 2 E such that v = v1 or v = v2. 2. for and e 2 E, there exists a face f 2 F such that e is in f. 3. if two faces intersect in space, then the vertex or edge of intersection is in the mesh. If all of the faces of a polygon mesh are triangles, then we call it a triangle mesh (trimesh). Polygons can be tessellated to form triangle meshes. Definition 2 We classify edges in a mesh based on the number of faces they are part of: • A boundary edge is part of exactly one face. • An interior edge is part of two or more faces. • A manifold edge is part of exactly two faces. • A junction edge is part of three or more faces. Junction edges are to be avoided; they can cause cracks when rendering the mesh. Definition 3 A polymesh is connected if the undirected graph G = (VF ;EE), called the dual graph, is connected, where • VF is a set of graph vertices corresponding to the faces of the mesh and • EE is a set of graph edges connecting adjacent faces.
    [Show full text]
  • Creating Simplified 3D Models with High Quality Textures
    University of Wollongong Research Online Faculty of Engineering and Information Sciences - Faculty of Engineering and Information Sciences Papers: Part A 2015 Creating Simplified 3D oM dels with High Quality Textures Song Liu University of Wollongong, [email protected] Wanqing Li University of Wollongong, [email protected] Philip O. Ogunbona University of Wollongong, [email protected] Yang-Wai Chow University of Wollongong, [email protected] Publication Details Liu, S., Li, W., Ogunbona, P. & Chow, Y. (2015). Creating Simplified 3D Models with High Quality Textures. 2015 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2015 (pp. 264-271). United States of America: The Institute of Electrical and Electronics Engineers, Inc.. Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW Library: [email protected] Creating Simplified 3D oM dels with High Quality Textures Abstract This paper presents an extension to the KinectFusion algorithm which allows creating simplified 3D models with high quality RGB textures. This is achieved through (i) creating model textures using images from an HD RGB camera that is calibrated with Kinect depth camera, (ii) using a modified scheme to update model textures in an asymmetrical colour volume that contains a higher number of voxels than that of the geometry volume, (iii) simplifying dense polygon mesh model using quadric-based mesh decimation algorithm, and (iv) creating and mapping 2D textures to every polygon in the output 3D model. The proposed method is implemented in real-Time by means of GPU parallel processing. Visualization via ray casting of both geometry and colour volumes provides users with a real-Time feedback of the currently scanned 3D model.
    [Show full text]
  • Modeling: Polygonal Mesh, Simplification, Lod, Mesh
    The Modeling-Rendering Paradigm Modeler: Renderer: EECS 487: Interactive Modeling complex shapes Vertex data • no equation For a chair, Face, etc. Fixed function transForm and Vertex shader • instead, achieve complexity using lighting Computer Graphics simple pieces • polygons, parametric surfaces, or Clip, homogeneous divide and viewport Lecture 36: implicit surfaces scene graph Rasterize • Polygonal mesh simplification • with arbitrary precision, in principle Texture stages Fragment shader Fragment merging: stencil, depth 3D Geometry Representations 2D: Range Image Represent different kinds oF inFormation: Image with depth inFormation point data, surface data, volumetric data • acquired From range scanner, incl. MicrosoFt Kinect and Google Tango Points Solids • not a complete 3D description: does not include • 2D: range image • Constructive Solid Geometry part oF object occluded From viewpoint • 3D: point cloud • Voxels Surfaces Procedural • Polygonal mesh • Particle system • Parametric surfaces • Spring-mass system Cyberware • Subdivision surfaces • Fractals • Implicit surfaces Curless Range image Tessellation Range surface Funkhouser Funkhouser, Ramamoorthi 3D: Point Cloud Surfaces Unstructured set oF 3D Boundary representation (B-reps) point samples • sometimes we only care about the surface, e.g., when Acquired From range finder rendering opaque objects and performing geometric computations Disadvantage: no structural inFo • adjacency/connectivity have to use e.g., k-nearest neighbors to compute Increasingly hot topic in graphics/vision
    [Show full text]
  • Polygonal Meshes
    Polygonal Meshes COS 426 3D Object Representations Points Solids Range image Voxels Point cloud BSP tree CSG Sweep Surfaces Polygonal mesh Subdivision High-level structures Parametric Scene graph Implicit Application specific 3D Object Representations Points Solids Range image Voxels Point cloud BSP tree CSG Sweep Surfaces Polygonal mesh Subdivision High-level structures Parametric Scene graph Implicit Application specific 3D Polygonal Mesh Set of polygons representing a 2D surface embedded in 3D Isenberg 3D Polygonal Mesh Geometry & topology Face Edge Vertex (x,y,z) Zorin & Schroeder Geometry background Scene is usually approximated by 3D primitives Point Vector Line segment Ray Line Plane Polygon 3D Point Specifies a location Represented by three coordinates Infinitely small typedef struct { Coordinate x; Coordinate y; Coordinate z; } Point; (x,y,z) Origin 3D Vector Specifies a direction and a magnitude Represented by three coordinates Magnitude ||V|| = sqrt(dx dx + dy dy + dz dz) Has no location typedef struct { (dx,dy,dz) Coordinate dx; Coordinate dy; Coordinate dz; } Vector; 3D Vector Dot product of two 3D vectors V1·V2 = ||V1 || || V2 || cos(Θ) (dx1,dy1,dz1) Θ (dx2,dy2 ,dz2) 3D Vector Cross product of two 3D vectors V1·V2 = (dy1dx2 - dz1dy2, dz1dx2 - dx1dz2, dx1dy2 - dy1dx2) V1xV2 = vector perpendicular to both V1 and V2 ||V1xV2|| = ||V1 || || V2 || sin(Θ) (dx1,dy1,dz1) Θ (dx2,dy2 ,dz2) V1xV2 3D Line Segment Linear path between two points Parametric representation: » P = P1 + t (P2 - P1),
    [Show full text]
  • Part 2 – Chapter 4: Modelling and Rendering of 3D Objects
    Part 2 – Chapter 4: Modelling and Rendering of 3D Objects 4.1 3D Shape Representations 4.2 Example: Rendering 3D objects using OpenGL 4.3 Depth Buffer - Handling occlusion in 3D 4.4 Double Buffering - Rendering animated objects 4.5 Vertex colours & colour interpolation - Increasing realism 4.6 Backface culling – Increasing efficiency 4.7 Modelling and Animation Tools © 2017 Burkhard Wuensche Dept. of Computer Science, University of Auckland COMPSCI 373 Computer Graphics & Image Processing 2 Polygonmesh The most suitable shape representation Parametric Surface depends on the application => IMPORTANT DESIGN DECISION Subdivison Surface Implicit Surface Constructive Solid Geometry Point Cloud © 2017 Burkhard Wuensche Dept. of Computer Science, University of Auckland COMPSCI 373 Computer Graphics & Image Processing 3 Defined by a set of vertices and a set of faces Faces are (usually) quadrilaterals or triangles The illusion of a solid 3D object is achieved by representing the object’s boundary surface with a polygon mesh © 2017 Burkhard Wuensche Dept. of Computer Science, University of Auckland COMPSCI 373 Computer Graphics & Image Processing 4 Advantages Disadvantages • Easy to define - just • Impractical for everything but the define vertex positions most basic meshes and connectivity • Time-consuming • No control over shape properties (e.g. curvature, smoothness) 1’ 10’ 8’ 6 56’5’ 1 10 8 7 3 3’ 9 2 2’ 4’ 4 © 2017 Burkhard Wuensche Dept. of Computer Science, University of Auckland COMPSCI 373 Computer Graphics & Image Processing 5 Defined as function p(s,t)=(x(s,t), y(s,t), z(s,t)) Direct definition is difficult, but we can use spline surfaces where surfaces are defined using control points, e.g.
    [Show full text]
  • Visualizing with Microstation Course Guide
    Visualizing with MicroStation Course Guide TRN001370-1/0001 Trademarks AccuDraw, the “B” Bentley logo, MDL, MicroStation, MicroStationCSP, MicroStation Modeler, MicroStation PowerDraft, MicroStation Review, MicroStation Vault, QuickVision, SmartLine and TeamMate are registered trademarks of Bentley Systems, Incorporated. Bentley, MicroStation MasterPiece and PowerScope are trademarks of Bentley Systems, Incorporated. Bentley SELECT is a service mark of Bentley Systems, Incorporated. HMR and Image Manager are trademarks of HMR Inc. Adobe, the Adobe logo, Acrobat, the Acrobat logo, Distiller, Exchange, and PostScript are trademarks of Adobe Systems Incorporated. Windows is a registered trademark and Win32s is a trademark of Microsoft Corporation. Other brands and product names are the trademarks of their respective owners. Copyrights 1997 Bentley Systems, Incorporated. MicroStation® 95 1995 Bentley Systems, Incorporated. ©1997 HMR Inc. All rights reserved. MicroStation Image Manager ©1997 HMR Inc. ©1996 LCS/Telegraphics. Portions of QuickVision are ©1993-1995 Criterion Software Ltd. and its licensors. Portions of QuickVision were developed by the CAD Perfect Development Laboratory. Portions 1992-1997 Spotlight Graphics, Inc. Portions 1993-1995 Spyglass, Inc. IGDS file formats 1987-1994 Intergraph Corporation. Intergraph Raster File Formats 1994 Intergraph Corporation Used with permission. Portions 1992-1994 Summit Software Company. Unpublished – rights reserved under the copyright laws of the United States. Visualizing with MicroStation
    [Show full text]
  • Modifing Thingiverse Model in Blender
    Modifing Thingiverse Model In Blender Godard usually approbating proportionately or lixiviate cooingly when artier Wyn niello lastingly and forwardly. Euclidean Raoul still frivolling: antiphonic and indoor Ansell mildew quite fatly but redipped her exotoxin eligibly. Exhilarating and uncarted Manuel often discomforts some Roosevelt intimately or twaddles parabolically. Why not built into inventor using thingiverse blender sculpt the model window Logo simple metal, blender to thingiverse all your scene of the combined and. Your blender is in blender to empower the! This model then merging some models with blender also the thingiverse me who as! Cam can also fits a thingiverse in your model which are interchangeably used software? Stl files software is thingiverse blender resize designs directly from the toolbar from scratch to mark parts of the optics will be to! Another method for linux blender, in thingiverse and reusable components may. Svg export new geometrics works, after hours and drop or another one of hobbyist projects its huge user community gallery to the day? You blender model is thingiverse all models working choice for modeling meaning you can be. However in blender by using the product. Open in blender resize it original shape modeling software for a problem indeed delete this software for a copy. Stl file blender and thingiverse all the stl files using a screenshot? Another one modifing thingiverse model in blender is likely that. If we are in thingiverse object you to modeling are. Stl for not choose another source. The model in handy later. The correct dimensions then press esc to animation and exporting into many brands and exported file with the.
    [Show full text]
  • GPU Volume Voxelization Exploration of the Performance Characteristics of Different GPU-Based Implementations
    EXAMENSARBETE INOM TEKNIK, GRUNDNIVÅ, 15 HP STOCKHOLM, SVERIGE 2019 GPU Volume Voxelization Exploration of the performance characteristics of different GPU-based implementations GRIGORY GLUKHOV ALEKSANDRA SOLTAN KTH SKOLAN FÖR ELEKTROTEKNIK OCH DATAVETENSKAP GPU Volume Voxelization Exploration of the performance characteris- tics of different GPU-based implementations Aleksandra Soltan Grigory Glukhov Examiner Johan Montelius Supervisor Thomas Sjöland A thesis presented for the degree of Bachelor of Information and Communication Technology KTH Royal Institute of Technology School of Electrical Engineering and Computer Science SE-100 44 Stockholm, Sweden June 2019 page intentionally left blank 1 Abstract In recent years, voxel-based modelling has seen a reintroduction to computer game development through massive graphics hardware improvements. Never- theless, polygons continue to be the default building block of 3D objects, intro- ducing a need for the transformation of polygon meshes into voxel-based models; this process is known as voxelization. Efficient voxelization algorithms take ad- vantage of the flexibility and control offered by modern, programmable GPU pipelines. However, the variability in possible approaches poses the question of how different GPU-based implementations affect voxelization performance. This thesis explores the impact of GPU-based improvements by comparing four different implementations of a solid voxelization algorithm. The implemen- tations include a naive transition from the CPU to the GPU, a non-branching execution path approach, data pre-processing, and a combination of the two previous approaches. Benchmarking experiments run on four, standard polygo- nal models and three graphics cards (NVIDIA and AMD) provide runtime and memory usage data for each implementation. A comparative analysis is per- formed on the basis of this data to determine the performance impact of the GPU-based adjustments to the voxelization algorithm implementation.
    [Show full text]
  • Reading and Voxelization of 3D Models
    Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2013, 5(9):420-427 ISSN : 0975-7384 Research Article CODEN(USA) : JCPRC5 Reading and voxelization of 3D models Xu Haili, Wang Heng, Zhu Longbiao and Hua Guoran School of Mechanical Engineering, Nantong University, Nantong, Jiangsu, China __________________________________________________________________________________________ ABSTRACT 3D models have got widespread attention in graphics currently. Most 3D models are used for visual calculation, but they only contain geometric and appearance properties and the description of high-level semantic features suitable for automatically matching are very little. So, how to reasonably describe 3D models (feature extraction) is a difficult problem of the prime importance. Voxelization just can solve this problem. The voxel model is helpful for regularization of 3D models and is convenient to extract models’ characteristic signals. This paper proposed a voxelization method based on edclidean distance measurement to voxelize models’ vertices, edges and faces. Experiment results indicated that the method is efficient and effective for generating correct entity voxel models. Keywords: 3D models, voxelization, polygonal meshes, OpenGL __________________________________________________________________________________________ INTRODUCTION Following sound, images and video signal, 3D models have got widespread attention in graphics since 90's of 20th century. 3D models are widely used in image processing, animation simulation, entertainment and gaming and geometric modeling etc, which tend to replace 2D drawings in engineering design. Most 3D models are used for visual calculation. They only contain geometric and appearance properties, and the description of high-level semantic features suitable for automatically matching are very little. So, how to reasonably describe 3D models (feature extraction) is a difficult problem of the prime importance[1].
    [Show full text]