Parallel algorithms for some functions of two convex polygons

DOI10.1007/BF01762130MaRDI QIDQ1105374zbMATH OpenFDO

Authors Mikhail J. Atallah, Michael T. Goodrich

Publication date 1988

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometryconvex polygonsparallel algorithmsmodel of parallel computationCREW-PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• A linear time algorithm for the computation of some distance functions between convex polygons
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• scientific article; zbMATH DE number 278832
• scientific article; zbMATH DE number 4050997

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Computing the extreme distances between two convex polygons
• Convex hulls of finite sets of points in two and three dimensions
• Maintenance of configurations in the plane
• Parallel computational geometry

Cited in

(26)

• A sublogarithmic convex hull algorithm
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• Finding the Convex Hull of Discs in Parallel
• Optimal randomized parallel algorithms for computational geometry
• A parallel algorithm for finding congruent regions
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• An optimal algorithm for finding the separation of simple polygons
• Optimal BSR solutions to several convex polygon problems
• A nearly optimal deterministic parallel Voronoi diagram algorithm
• OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
• Comments on two parallel algorithms for the planar convex hull problem
• Fast randomized parallel methods for planar convex hull construction
• A time-optimal parallel algorithm for three-dimensional convex hulls
• Finding a closet visible vertex pair between two polygons
• A parallel algorithm for computing polygon set operations
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• Optimal, output-sensitive algorithms for constructing planar hulls in parallel
• An optimal algorithm for the separating common tangents of two polygons
• CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
• Common tangents of two disjoint polygons in linear time and constant workspace
• Parallel algorithm for corner finding on digital curves
• Optimal parallel algorithms for point-set and polygon problems
• Finding congruent regions in parallel
• Constructing the Voronoi diagram of a set of line segments in parallel
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
• Convexity problems on meshes with multiple broadcasting

This page was built for publication: Parallel algorithms for some functions of two convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105374)