An investigation of graph traversal algorithms in folded sheet metal parts design

A. Qattawi, Abdel Mayyas, M. A. Omar

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Decomposing 3-D geometries into flat layouts is a two-step process; specifically, its generation and analysis. The generation phase employs graph traversal procedures to extract the topological information from the parent-folded (or 3-D geometry) structure. This manuscript investigates the role of the graph traversal approaches in generating such layouts with application to folded sheet metals. The study executes several graph traversing routines and then examines the generated layouts for manufacturability considerations and product cost. The specific search routines included in this study are the depth-first search, the breadth-first search, the Prim's algorithm, the A * search, in addition to routines based on enumerating the minimum spanning trees only, and enumeration algorithms that work on all spanning trees. The study exposes the role of such routines in controlling the proposed flat layout(s) manufacturability and cost. Additionally, the study examines the compatibility of some folded sheet metal designs (i.e., its geometry type: manifold and non-manifold) for each of the aforementioned algorithms.

Original languageEnglish (US)
Pages (from-to)2237-2246
Number of pages10
JournalInternational Journal of Advanced Manufacturing Technology
Volume69
Issue number9-12
DOIs
StatePublished - Dec 2013
Externally publishedYes

Fingerprint

Sheet metal
Geometry
Costs

Keywords

  • Flat pattern analysis
  • Fold forming
  • Graph traversal algorithms
  • Sheet metal

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Control and Systems Engineering
  • Computer Science Applications
  • Software
  • Mechanical Engineering

Cite this

An investigation of graph traversal algorithms in folded sheet metal parts design. / Qattawi, A.; Mayyas, Abdel; Omar, M. A.

In: International Journal of Advanced Manufacturing Technology, Vol. 69, No. 9-12, 12.2013, p. 2237-2246.

Research output: Contribution to journalArticle

@article{d6f0a82131fa41409556e184c27260d3,
title = "An investigation of graph traversal algorithms in folded sheet metal parts design",
abstract = "Decomposing 3-D geometries into flat layouts is a two-step process; specifically, its generation and analysis. The generation phase employs graph traversal procedures to extract the topological information from the parent-folded (or 3-D geometry) structure. This manuscript investigates the role of the graph traversal approaches in generating such layouts with application to folded sheet metals. The study executes several graph traversing routines and then examines the generated layouts for manufacturability considerations and product cost. The specific search routines included in this study are the depth-first search, the breadth-first search, the Prim's algorithm, the A * search, in addition to routines based on enumerating the minimum spanning trees only, and enumeration algorithms that work on all spanning trees. The study exposes the role of such routines in controlling the proposed flat layout(s) manufacturability and cost. Additionally, the study examines the compatibility of some folded sheet metal designs (i.e., its geometry type: manifold and non-manifold) for each of the aforementioned algorithms.",
keywords = "Flat pattern analysis, Fold forming, Graph traversal algorithms, Sheet metal",
author = "A. Qattawi and Abdel Mayyas and Omar, {M. A.}",
year = "2013",
month = "12",
doi = "10.1007/s00170-013-5181-9",
language = "English (US)",
volume = "69",
pages = "2237--2246",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "9-12",

}

TY - JOUR

T1 - An investigation of graph traversal algorithms in folded sheet metal parts design

AU - Qattawi, A.

AU - Mayyas, Abdel

AU - Omar, M. A.

PY - 2013/12

Y1 - 2013/12

N2 - Decomposing 3-D geometries into flat layouts is a two-step process; specifically, its generation and analysis. The generation phase employs graph traversal procedures to extract the topological information from the parent-folded (or 3-D geometry) structure. This manuscript investigates the role of the graph traversal approaches in generating such layouts with application to folded sheet metals. The study executes several graph traversing routines and then examines the generated layouts for manufacturability considerations and product cost. The specific search routines included in this study are the depth-first search, the breadth-first search, the Prim's algorithm, the A * search, in addition to routines based on enumerating the minimum spanning trees only, and enumeration algorithms that work on all spanning trees. The study exposes the role of such routines in controlling the proposed flat layout(s) manufacturability and cost. Additionally, the study examines the compatibility of some folded sheet metal designs (i.e., its geometry type: manifold and non-manifold) for each of the aforementioned algorithms.

AB - Decomposing 3-D geometries into flat layouts is a two-step process; specifically, its generation and analysis. The generation phase employs graph traversal procedures to extract the topological information from the parent-folded (or 3-D geometry) structure. This manuscript investigates the role of the graph traversal approaches in generating such layouts with application to folded sheet metals. The study executes several graph traversing routines and then examines the generated layouts for manufacturability considerations and product cost. The specific search routines included in this study are the depth-first search, the breadth-first search, the Prim's algorithm, the A * search, in addition to routines based on enumerating the minimum spanning trees only, and enumeration algorithms that work on all spanning trees. The study exposes the role of such routines in controlling the proposed flat layout(s) manufacturability and cost. Additionally, the study examines the compatibility of some folded sheet metal designs (i.e., its geometry type: manifold and non-manifold) for each of the aforementioned algorithms.

KW - Flat pattern analysis

KW - Fold forming

KW - Graph traversal algorithms

KW - Sheet metal

UR - http://www.scopus.com/inward/record.url?scp=84892372764&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892372764&partnerID=8YFLogxK

U2 - 10.1007/s00170-013-5181-9

DO - 10.1007/s00170-013-5181-9

M3 - Article

VL - 69

SP - 2237

EP - 2246

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 9-12

ER -