Minimal fixturing of frictionless assemblies: Complexity and algorithms

DOI10.1007/PL00014419zbMath0882.68076OpenAlexW2160743809MaRDI QIDQ1364358

Pradeep Khosla, David Baraff, Raju Mattikalli

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)

Related Items (1)

IMMOBILIZING HINGED POLYGONS

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