@inproceedings{259568e7b02d410383697acfe035463c,
title = "MESH COMPUTER ALGORITHMS FOR LINE SEGMENTS AND SIMPLE POLYGONS.",
abstract = "Asymptotically optimal parallel algorithms are given for using a mesh computer to determine several fundamental geometric properties involving line segments and simple polygons. Given n or fewer line segments, or n or fewer line segments that represent simple polygons, optimal O(n**1**/**2) time mesh algorithms are presented to solve a variety of area and intersection problems on a mesh computer with n simple processing elements.",
author = "Russ Miller and Stout, \{Quentin F.\}",
year = "1987",
language = "English",
isbn = "0271006080",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",
pages = "282--285",
editor = "Sahni, \{Sartaj K.\}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
note = "Proc Int Conf Parallel Process 1987 ; Conference date: 17-08-1987 Through 21-08-1987",
}