•  
  •  
 

Turkish Journal of Electrical Engineering and Computer Sciences

Author ORCID Identifier

ONAT KUŞKONMAZ: 0009-0000-4153-594X

YUSUF SAHİLLİOĞLU: 0000-0002-7997-4232

DOI

10.55730/1300-0632.4102

Abstract

Approximate convex decomposition enables the simplification of complex shapes into manageable convex components. In this work, we propose a novel surface-based method to achieve this which leads to efficient computation times and sufficiently convex results while avoiding over-approximating the input model. We start approximation using mesh simplification. Then we iterate over the surface polygons of the mesh and divide them into convex groups. We utilize planar and angular equations to determine suitable neighboring polygons for inclusion in forming convex groups. To ensure our method outputs a sufficient result for a wide range of input shapes, we run multiple iterations of our algorithm using varying planar thresholds and mesh simplification levels. For each simplification level, we find the planar threshold that leads to the decomposition with the least number of pieces while remaining under a certain concavity threshold. Then, we find the simplification level that houses the decomposition with the least concavity, and output that decomposition as our result. We demonstrate experiment results that show the viability of our method as well as compare our work to two established convex decomposition algorithms, providing discussion on the shortcomings and advantages of the proposed method.

Keywords

3D Approximate Convex Decomposition, Computer Graphics, Mesh Segmentation, Shape Abstraction

First Page

774

Last Page

789

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Download

Share

COinS