A parallel algorithm for computing polygon set operations

DOI10.1006/JPDC.1995.1050MaRDI QIDQ1892866zbMATH OpenOpenAlexFDO

Authors Raghu Karinthi, Kankanahalli Srinivas, 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

zbMATH Keywords

parallel algorithmrandomized algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Common intersections of polygons
• Optimal parallel algorithms for point-set and polygon problems
• Triangulating a polygon in parallel
• scientific article; zbMATH DE number 4050997
• Parallel algorithms for some functions of two convex polygons

Cited in

(13)

• An algorithm for set operations on nonconvex polygons (with an application to census tracts)
• A parallel algorithm for finding congruent regions
• A parallel algorithm for the conductor of a point set
• Rectangulating rectilinear polygons in parallel
• Area and perimeter computation of the union of a set of iso-rectangles in parallel
• A procedure for computing the symmetric difference of regions defined by polygonal curves
• scientific article; zbMATH DE number 6719480 (Why is no real title available?)
• A fast algorithm for the Boolean masking problem
• scientific article; zbMATH DE number 1190951 (Why is no real title available?)
• scientific article; zbMATH DE number 1955838 (Why is no real title available?)
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
• Rectangulating rectilinear polygons in parallel
• Common intersections of polygons

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)