Share Your Research, Maximize Your Social Impacts
A New Heuristic Algorithm for Constructing Steiner Trees inside Simple polygons in Presence of Obstacles
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.2, No. 3)Publication Date: 2013-07-31
Authors : Vahid Khosravinejad; Alireza Bagheri; Alireza Khosravinejad;
Page : 118-121
Keywords : Euclidean Steiner Minimal Tree; Straight skeleton of simple polygon; geodesic convex hull;
Source : Download
Find it from : Google Scholar
Abstract
Steiner tree problem leads to solutions in several scientific and business contexts, including computer networks routing and electronic integrated circuits. Computing fields of this problem has become an important research topic in computational geometry. ...
Other Latest Articles
- Watchdog-LEACH: A new method based on LEACH protocol to Secure Clustered Wireless Sensor Networks
- A New Approach for Labeling Images Using CAPTCHA in Image Semantic Search Engines
- USE OF E-LEARNING TOOLS TO SOLVE GROUP WORK PROBLEMS IN HIGHER EDUCATION: A CASE STUDY OF GULF COUNTRY
- Designing a Clustering and Prediction-based Protocol for Target Tracking in Wireless Sensor Networks (WSNs)
- A Hybrid Approach for Optimal Feature Selection based on Evolutionary Algorithms and Classic Approaches
Last modified: 2014-02-03 22:12:39