Abstract
In order to improve the voxelization efficiency of large data,a fast and simple voxelization algorithm was proposed for the Triangulated Irregular Network(TIN) model.The surface voxelization was realized by dividing triangular facets,which could convert surface voxelization to points voxelization.Then,the solid voxelization was realized by using the theory of depth buffer to quickly search initial seed.The experimental results show that for the complex and precise TIN model,a voxel model of 26-connected which is approached to original model can be efficiently generated,and it has a high time efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
