The complexity of oblivious plans for orienting and distinguishing polygonal parts-Reference-Cited by-同舟云学术

The complexity of oblivious plans for orienting and distinguishing polygonal parts

Published:1995-11 Issue:5 Volume:14 Page:367-397
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Chen Yui-Bin,Ierardi D. J.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01192046.pdf

Reference20 articles.

1. Y. B. Chen and D. J. Ierardi, Oblivious plans for orienting and distinguishing polygonal parts.Proceedings of the Fourth Canadian Conference on Computation Geometry. St. John's, Newfoundland, 1992, pp. 204?209.

2. K. Y. Goldberg. Orienting polygonal parts without sensors.Algorithmica, 10:201?225, 1993.

3. B. K. Natarajan. Some paradigms for the automated design of parts feeders.International Journal of Robotics Research, 8(6):98?109, December 1989.

4. R. Cole and C. Yap. Shape from probing.Journal of Algorithms, 8(1): 19?38, 1987.

5. A. Rao and K. Y. Goldberg. On the recovery of a polygon's shape from its diameter function.Proceedings of the Fourth Canadian Conference on Computational Geometry. St. John's, Newfoundland, 1992, pp. 210?215.

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secure Recovery Procedure for Manufacturing Systems Using Synchronizing Automata and Supervisory Control Theory;IEEE Transactions on Automation Science and Engineering;2022-01

2. Синхронизация конечных автоматов;Uspekhi Matematicheskikh Nauk;2022

3. Synchronization of finite automata;Russian Mathematical Surveys;2022

4. Enforcing State-Based Opacity using Synchronizing Automata;2021 60th IEEE Conference on Decision and Control (CDC);2021-12-14

5. A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices;Fundamenta Informaticae;2021-06-30