Steiner Minimal Trees in E 3: Theory, Algorithms, and Applications

J. MacGregor Smith ()
Additional contact information
J. MacGregor Smith: University of Massachusetts, Department of Mechanical and Industrial Engineering

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1143-1216 from Springer

Abstract: Abstract Let’s say that you are going to design a new electronic circuit at the molecular/atomic level where you know beforehand the basic number of atomic elements of the circuit and you wish to arrange them so that they achieve an optimal configuration that is both compact, stable, and integrated electrically. How would you configure the atoms? If one assumes that the cost of putting together the molecular structure is proportional to distance i.e. the potential energy in the system, then you would want to minimize the overall interconnecting distance between the atoms. This is fundamentally the Steiner problem in E 3. Figure 1 demonstrates a geometric construction for the Steiner Minimal Tree of N=6 vertices in E 3.

Keywords: Voronoi Diagram; Steiner Tree; Delaunay Triangulation; Triple Helix; Optimal Configuration (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_17

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().