Knowledge Base Repository

In addition to research papers, the Design Society is developing several valuable resources for those interested in the study of design. These include a repository of PhD theses, a library of case studies and transcripts of design activities, and an archive of our newsletters. Please note that these resources are accessible exclusively to Design Society members.

A Planarity-Based Complexity Metric

Kortler, Sebastian; Kreimeyer, Matthias; Lindemann, Udo


Type:
Year:
2009
Editor:
Norell Bergendahl, M.; Grimheden, M.; Leifer, L.; Skogstad, P.; Lindemann, U.
Author:
Series:
ICED
Section:
Design Methods and Tools
Page(s):
31-42
Abstract:
Complexity in product design, e.g. in product architectures or process structures, continuously increases. To properly evaluate a complex system or to compare it to other systems, complexity metrics enable the numerical assessment of a system's underlying structure. The more complex such a structure is, the more likely it is to have many linkages between the elements. Typically, the number of edges that cross each other increases with the degree of complexity. This fact is used to derive a complexity metric that computes the distance of a given network from an ideally planar graph, i.e. a network that has no edges that cross each other. The approach proposed closes an existing lack of structural criteria and metrics and complements the existing possibilities to measure structural complexity, i.e. the particular interaction of a system?s elements and their interdependencies. To this day, planarity is not used in this context. The metric is developed based on a state-of-the-art algorithm and tested with a small example from an industrial design process to illustrate its independence to existing complexity metrics.
Keywords:

This site uses cookies and other tracking technologies to assist with navigation and your ability to provide feedback, analyse your use of our products and services, assist with our promotional and marketing efforts, and provide content from third parties. Privacy Policy.