Computing fence designs for orienting parts

DOI10.1016/S0925-7721(98)00010-8MaRDI QIDQ1265285zbMATH OpenOpenAlexFDO

Authors Robert-Paul Berretty, Ken Goldberg, Mark H. Overmars, A. Frank van der Stappen

Publication date 10 November 1998

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(98)00010-8

zbMATH Keywords

automated manufacturing processes

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Recommendations

• A near-quadratic algorithm for fence design
• Orienting polygonal parts without sensors
• Orienting polyhedral parts by pushing

Cites work

• Computing fence designs for orienting parts
• Geometric eccentricity and the complexity of manipulation plans
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Orienting polygonal parts without sensors
• The complexity of oblivious plans for orienting and distinguishing polygonal parts

Cited in

(8)

• Computing fence designs for orienting parts
• A near-quadratic algorithm for fence design
• Bounding the locus of the center of mass for a part with shape variation
• Reprint of: Bounding the locus of the center of mass for a part with shape variation
• Model of the process of load unit stream sorting by means of flexible active fence
• Analysis of translational positioning of unit loads by directionally-oriented friction force fields
• Orienting polyhedral parts by pushing
• Orienting polygonal parts without sensors

This page was built for publication: Computing fence designs for orienting parts

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