System and method for planning support removal in hybrid manufacturing with the aid of a digital computer
AssigneePalo Alto Research Center Incorporated
InventorsSaigopal Nelaturi, Morad Behandish
Life of this patent
Estimating the term…
Loading patent…
AssigneePalo Alto Research Center Incorporated
InventorsSaigopal Nelaturi, Morad Behandish
Estimating the term…
Algorithmic reasoning about a cutting tool assembly's space of feasible configurations can be effectively harnessed to construct a sequence of motions that guarantees a collision-free path for the tool assembly to remove each support structure in the sequence. A greedy algorithm models the motion of the cutting tool assembly through the free-spaces around the intermediate shapes of the part as the free-spaces iteratively reduce in size to the near-net shape to determine feasible points of contact for the cutting tool assembly. Each support beam is evaluated for a contact feature along the boundary of the near-net shape that constitutes a feasible point of contact. If a support beam has at least one feasible configuration at each point, the support beam is deemed ‘accessible’ and a collection of tool assembly configurations that are guaranteed to be non-colliding but which can access all points of contact of each accessible support beam can be generated.
A system for planning support removal in hybrid manufacturing with the aid of a digital computer, comprising the steps of:
A method for planning support removal in hybrid manufacturing with the aid of a digital computer, comprising the steps of:
Dependencies are inferred from the claim text.