A parallel algorithm for computing polygon set operations
From MaRDI portal
Publication:1892866
DOI10.1006/JPDC.1995.1050zbMATH Open0826.68062OpenAlexW2161987339MaRDI QIDQ1892866
Kankanahalli Srinivas, Raghu Karinthi, George S. Almasi
Publication date: 6 July 1995
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1995.1050
Related Items (6)
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel ⋮ An algorithm for set operations on nonconvex polygons (with an application to census tracts) ⋮ Rectangulating rectilinear polygons in parallel ⋮ Rectangulating rectilinear polygons in parallel ⋮ A parallel algorithm for finding congruent regions ⋮ A parallel algorithm for the conductor of a point set
This page was built for publication: A parallel algorithm for computing polygon set operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892866)
