The complexity of oblivious plans for orienting and distinguishing polygonal parts
From MaRDI portal
Publication:1900891
DOI10.1007/BF01192046zbMATH Open0830.68062MaRDI QIDQ1900891FDOQ1900891
Authors: Yui-Bin Chen, D. J. Ierardi 
Publication date: 25 October 1995
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4128383
- The complexity of recognizing polyhedral scenes
- NP-completeness of the Planar Separator Problems
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane
- On the obfuscation complexity of planar graphs
- The complexity of computing minimum separating polygons
- scientific article; zbMATH DE number 1500509
- The complexity of planarity testing
- scientific article; zbMATH DE number 1817739
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth
Cites Work
Cited In (12)
- Orienting polyhedral parts by pushing
- Mechanical parts orienting: the case of a polyhedron on a table
- Orienting polygonal parts without sensors
- Reprint of: Bounding the locus of the center of mass for a part with shape variation
- Bounding the locus of the center of mass for a part with shape variation
- Computing fence designs for orienting parts
- Computational complexity of synchronization under sparse regular constraints
- On randomized generation of slowly synchronizing automata
- Černý's conjecture and the road colouring problem
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Synchronizing Automata and the Černý Conjecture
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
This page was built for publication: The complexity of oblivious plans for orienting and distinguishing polygonal parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900891)
