Abstract
The author proposed a triangular mesh simplification algorithm with the methodology of vertex culling, which is based on bounded error. The algorithm includes several steps as follow. Firstly, the algorithm arrays the vertex according to the curvature. The curvature of local area around one vertex reduces in the array. Secondly, for one vertex to be deleted, the bounding box’s height of the local area will be calculated. And the reduction of the bounding box’s height is controlled as restraint of vertex culling. After the vertex culling, triangular mesh reconstruction is conducted on polygon to fill up the hollows formed in the above steps. This algorithm well balanced the deletion rate and deletion error in the experiment.
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.
