A near-quadratic algorithm for fence design

Published

Journal Article

A part feeder is a mechanism that receives a stream of identical parts in arbitrary orientations and putputs them oriented the same way. Various sensorless part feeders have been proposed in the literature. The feeder we consider consists of a sequence of fences that extend partway across a conveyor belt; a polygonal part P carried by the belt is reoriented by each fence it encounters. We present an O(m + n 2log 3 n)-time algorithm to compute a sequence of fences that uniquely orients P, if one exists, where m is the total number of vertices and n is the number of stable edges of P. As in [3], we reduce the problem to searching for a path in a state graph that has O(n 3) edges. By exploiting various geometric properties of the state graph, we show that it can be represented implicitly and a desired path can be found in O(m + n 2log 3 n) time. Our technique is quite general and is applicable to other part manipulation problems. © 2004 Springer-Verlag.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Berretty, RP; Collins, AD

Published Date

  • December 1, 2004

Published In

Volume / Issue

  • 7 STAR /

Start / End Page

  • 347 - 362

Electronic International Standard Serial Number (EISSN)

  • 1610-742X

International Standard Serial Number (ISSN)

  • 1610-7438

Digital Object Identifier (DOI)

  • 10.1007/978-3-540-45058-0_21

Citation Source

  • Scopus