Minimal fixturing of frictionless assemblies: Complexity and algorithms

DOI10.1007/PL00014419MaRDI QIDQ1364358zbMATH OpenOpenAlexFDO

Authors David Baraff, Raju Mattikalli, P. K. Khosla

Publication date 23 November 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00014419

zbMATH Keywords

assembly tasksfixturing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Optimized synthesis of snapping fixtures
• Probabilistic algorithms for efficient grasping and fixturing
• On the complexity of assembly partitioning
• Assembly sequences for polyhedra
• A computational geometry approach to optimum clamping synthesis of machining fixtures

Cited in

(5)

• Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
• Optimized synthesis of snapping fixtures
• IMMOBILIZING HINGED POLYGONS
• scientific article; zbMATH DE number 797431 (Why is no real title available?)
• Stably placing piecewise smooth objects

This page was built for publication: Minimal fixturing of frictionless assemblies: Complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364358)