Assembly partitioning with a constant number of translations [electronic resource].

Published:: Arlington, Va. : National Science Foundation (U.S.), 1994.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
Physical Description:: 18 pages : digital, PDF file
Additional Creators:: Sandia National Laboratories, National Science Foundation (U.S.), and United States. Department of Energy. Office of Scientific and Technical Information

Access Online

www.osti.gov

Availability

Finding items...

Restrictions on Access:

Free-to-read Unrestricted online access

Summary:

The authors consider the following problem that arises in assembly planning: given an assembly, identify a subassembly that can be removed as a rigid object without disturbing the rest of the assembly. This is the assembly partitioning problem. Specifically, they consider planar assemblies of simple polygons and subassembly removal paths consisting of a single finite translation followed by a translation to infinity. They show that such a subassembly and removal path can be determined in O(n{sup 1.46}N⁶) time, where n is the number of polygons in the assembly and N is the total number of edges and vertices of all the parts together. They then extend this formulation to removal paths consisting of a small number of finite translations, followed by a translation to infinity. In this case the algorithm runs in time polynomial in the number of parts, but exponential in the number of translations a path may contain.

Report Numbers:

E 1.99:sand--94-1819
sand--94-1819

Subject(s):

Other Subject(s):

Note:

Published through SciTech Connect.
08/24/1994.
"sand--94-1819"
"DE95001857"
Wilson, R.H.; Halperin, D.

Type of Report and Period Covered Note:

Topical; 09/01/1994 - 09/01/1994

Funding Information:

AC04-94AL85000

View MARC record | catkey: 14112300