PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
From MaRDI portal
Publication:4017522
DOI10.1142/S0218195992000111zbMath0762.68063MaRDI QIDQ4017522
Publication date: 16 January 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37) Distributed algorithms (68W15)
This page was built for publication: PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS