Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/546590
Title: Characterization of 3D Digital Straight Segments and Planes towards Polygonization and Decomposition of 3D Objects
Researcher: Saha, Somrita
Guide(s): Biswas, Arindam
Keywords: Computer Science
Computer Science Information Systems
Engineering and Technology
University: Indian Institute of Engineering Science and Technology, Shibpur
Completed Date: 2023
Abstract: This research work deals with the characterization of geometric primitives such as 3D straight line segments and 3D plane segments in the digital domain. An attempt has been made to explore the characteristics of a 3D digital straight segment. Furthermore, in course of these explorations, it was newlineobserved that a 3D digital plane is a consecutive arrangement of a shifted 3D digital straight segment. This observation motivated the next work, which is the construction of 3D digital planes using the Greatest Common Divisor (GCD) of the components of its normal vector. An algorithm has been developed to construct the 3D digital plane corresponding to any integer normal vector. newline newline Next, an algorithm has been proposed to polygonize the surface of 3D digital objects, originally having triangulated surface. If the cosine of the dihedral angle between two face triangles is above a predefined threshold, then the faces are considered to be similar with respect to their normal vectors. In this work, such similar face triangles are called as quasi-coplanar face triangles. Starting with a base face, such faces are identified in a breadth first manner, merged together, and replaced with a polygon, which yields a significant amount of compression with respect to storage. Finally, another algorithm has been presented to decompose the surface of 3D digital objects into approximate convex regions. The proposed method is based on the volumetric analysis of the tetrahedrons generated by each two edge-adjacent face triangles of the input object. The volumes of the tetrahedrons are calculated using the scalar triple product of the vectors corresponding to the newlineedge-adjacent faces. Starting from a base face, each convex surface is grown by considering the edge-adjacent face triangles in a breadth first manner. newline newline The proposed methods of polygonization and approximate convex decomposition reveal interesting features regarding the shape of the input 3D digital object of concern.
Pagination: 138
URI: http://hdl.handle.net/10603/546590
Appears in Departments:Department of Information Technology

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File210.88 kBAdobe PDFView/Open
02_prelim pages.pdf378.45 kBAdobe PDFView/Open
03_contents.pdf95.6 kBAdobe PDFView/Open
04_abstract.pdf95.63 kBAdobe PDFView/Open
05_chapter 1.pdf810.58 kBAdobe PDFView/Open
06_chapter 2.pdf1.2 MBAdobe PDFView/Open
07_chapter 3.pdf1.53 MBAdobe PDFView/Open
08_chapter 4.pdf4.75 MBAdobe PDFView/Open
09_chapter 5.pdf3.13 MBAdobe PDFView/Open
10_annexure.pdf190.72 kBAdobe PDFView/Open
80_recommendation.pdf105.72 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: