Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/8397
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kedia, Y. | - |
dc.contributor.author | Hendre, A. | - |
dc.contributor.author | Jain, S. | - |
dc.contributor.author | Afroz, F. | - |
dc.contributor.author | Koolagudi, S.G. | - |
dc.date.accessioned | 2020-03-30T10:18:35Z | - |
dc.date.available | 2020-03-30T10:18:35Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | 12th IEEE International Conference Electronics, Energy, Environment, Communication, Computer, Control: (E3-C3), INDICON 2015, 2016, Vol., , pp.- | en_US |
dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/8397 | - |
dc.description.abstract | In this paper, we propose an unconventional layer based clipping algorithm for 3D regions. In computer graphics, clipping is used to select the required part of a graphical object, cut it out from the object and display it separately. The proposed algorithm is not based on any other algorithm generally used for clipping in computer graphics and has a much better time efficiency than the other clipping algorithms available. The 3D space i.e. a cuboid is clipped w.r.t. a rectangular clipping window. The novelty of the algorithm is that 2D regions are being clipped down to the dimensions of the intersection region and then varied along the depth(z-axis) to get the volume of intersection. The algorithm has been implemented for both unrotated and rotated cuboids. The proposed algorithm can have massive applications in any field that requires layer-wise imaging of 3D spaces such as 3D printing, medical imaging, modelling, etc. given the simplicity of its implementation. � 2015 IEEE. | en_US |
dc.title | Layer based 3D clipping | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.