Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference15 articles.
1. Masehian, E., Amin-Naseri, M.: A Voronoi diagram-visibility graph-potential field compound algorithm for robot path planning. J. Robot. Syst. 21(6), 275–300 (2004)
2. Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proceedings of IEEE International Symposium on Circuits and Systems-ISCAS’94, vol. 1, pp. 113–116. IEEE (1994)
3. Liu, C.H., Kuo, S.Y., Lee, D., Lin, C.S., Weng, J.H., Yuan, S.Y.: Obstacle-avoiding rectilinear Steiner tree construction: a Steiner-point-based algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(7), 1050–1060 (2012)
4. Huang, T., Young, E.F.: ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 882–893 (2013)
5. Müller-Hannemann, M., Tazari, S.: A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. 43(4), 395–409 (2010)