PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS

DOI10.1142/S0218195992000111MaRDI QIDQ4017522zbMATH OpenFDO

Authors Sumanta Guha

Publication date 16 January 1993

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195992000111

zbMATH Keywords

CREW PRAMfarthest neighborssimple polygons

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Computing external farthest neighbors for a simple polygon
• Optimal parallel algorithms for rectilinear link-distance problems
• Computing geodesic furthest neighbors in simple polygons
• Parallel algorithms for shortest path problems in polygons
• A linear time algorithm for finding all farthest neighbors in a convex polygon

Cited in

(6)

• A linear time algorithm for finding all farthest neighbors in a convex polygon
• Computing external farthest neighbors for a simple polygon
• An optimal parallel algorithm for computing furthest neighbors in a tree
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
• The symmetric all-furthest-neighbor problem
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm

This page was built for publication: PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS

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