Invention Grant
- Patent Title: Approximate hierarchical convex decomposition
-
Application No.: US17661193Application Date: 2022-04-28
-
Publication No.: US12293463B2Publication Date: 2025-05-06
- Inventor: Khaled Mammou , Adrian A Biagioli , Deepak S Tolani
- Applicant: Apple Inc.
- Applicant Address: US CA Cupertino
- Assignee: Apple Inc.
- Current Assignee: Apple Inc.
- Current Assignee Address: US CA Cupertino
- Agency: FLETCHER YODER PC
- Main IPC: G06T17/20
- IPC: G06T17/20 ; G06T7/64 ; G06T19/00

Abstract:
A method of decomposing a three-dimensional representation of an object into a plurality of convex hulls can include instantiating a cluster priority queue in a computing system memory that initially contains a cluster corresponding to the three-dimensional representation of the object, computing with a processor of the computing system a concavity measure for each cluster in the cluster priority queue, and, for the cluster with the highest concavity measure: (1) computing with the processor a cut plane that divides the cluster corresponding to the three-dimensional representation of the object into two new clusters, each of the two new clusters having a corresponding convex hull, wherein computing a cut plane includes performing a hierarchical search of potential cut planes, (2) removing the cluster corresponding to the three-dimensional representation of the object from the cluster priority queue, and (3) adding the two new clusters to the cluster priority queue.
Public/Granted literature
- US20230351697A1 APPROXIMATE HIERARCHICAL CONVEX DECOMPOSITION Public/Granted day:2023-11-02
Information query