1. Asano T, Asano T, Guibas L, Hersberger J, Imai H (1985) Visibility polygon search and Euclidean shortest paths. Proc IEEE Symp FOCS, pp 154–164
2. Asano T (1985) An efficient algorithm for finding the visibility polygon for a polygonal region with holes. Trans IECE Jpn, vol E 68, no 9, pp 557–559
3. Atallah MJ (1985) Simulations between mesh-connected processor arrays. Proc 20th Ann Allerton Conf Commun Control Comput, Monticello, III, (October 1985), pp 268–269
4. Aggarval A, Chazelle B, Guibas L, O'Dunlaing C, Yap C (1985) Parallel computational geometry. Proc 26th IEEE Symp FOCS, Portland Oregon (October 1985), pp 468–477
5. Asano T, Umeo H (1987) Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region. Proc Int Workshop Parallel Algorithm Architect, Suhl, GDR (May 1987), pp 77–85