Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS - MaRDI portal

PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS

From MaRDI portal

Publication:4017520

Jump to:navigation, search

DOI10.1142/S0218195992000093zbMath0763.68062MaRDI QIDQ4017520

Ruei-Chuan Chang, Fang-Rong Hsu, Richard Chia-Tung Lee

Publication date: 16 January 1993

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

zbMATH Keywords

visibility CREW PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Distributed algorithms (68W15)

Related Items (2)

Finding a closet visible vertex pair between two polygons ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

This page was built for publication: PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4017520&oldid=17726094"