We have recently developed an algorithm for the generation of Steiner trees in a barrier-free environment. The algorithm and related mathematical material appear elsewhere (1); the purpose of this note is to informally describe the concepts underlying our approach, and to demonstrate the computational feasibility of the method. Our problem model consists of a two-dimensional rectilinear grid containing nodes which must be connected by orthogonal line segments. The objective is to connect the set of nodes with a collection of lines having minimum total length. As will be demonstrated, our technique may be manually applied to problems of 25-50 points; much larger problems could be solved by utilizing computer processing. While the algorithm has not yet been proven to produce minimum length trees, we maintain that typical results are at least very nearly minimal. We hope to stimulate critical reactions to the following material by presenting it informally in this Newsletter.
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/generation-of-steiner-tree-connections-in-a-barrier-free-environment-0H0dos0rdG
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Generation of Steiner tree connections in a barrier-free environment
Smith, R. J.; Cao, C. V.
Follow ACM SIGDA Newsletter
, Volume 5 (3)
Association for Computing Machinery – Sep 1, 1975
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
