Web: http://arxiv.org/abs/2205.02961

May 9, 2022, 1:10 a.m. | Xinyue Wei, Minghua Liu, Zhan Ling, Hao Su

cs.CV updates on arXiv.org arxiv.org

Approximate convex decomposition aims to decompose a 3D shape into a set of
almost convex components, whose convex hulls can then be used to represent the
input shape. It thus enables efficient geometry processing algorithms
specifically designed for convex shapes and has been widely used in game
engines, physics simulations, and animation. While prior works can capture the
global structure of input shapes, they may fail to preserve fine-grained
details (e.g., filling a toaster's slots), which are critical for retaining …

3d arxiv search tree

More from arxiv.org / cs.CV updates on arXiv.org

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC

Senior Data Science Writer

@ NannyML | Remote

Director of AI/ML Engineering

@ Armis Industries | Remote (US only), St. Louis, California

Digital Analytics Manager

@ Patagonia | Ventura, California