Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures

Rongyao Zhao. Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, Workshop WADS 89, Ottawa, Canada, August 17-19, 1989, Proceedings. Volume 382 of Lecture Notes in Computer Science, pages 163-170, Springer, 1989.

Authors

Rongyao Zhao

This author has not been identified. Look up 'Rongyao Zhao' in Google