Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS

From MaRDI portal
Publication:4017522
Jump to:navigation, search

DOI10.1142/S0218195992000111zbMath0762.68063MaRDI QIDQ4017522

Sumantha Guha

Publication date: 16 January 1993

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



zbMATH Keywords

simple polygonsCREW PRAMfarthest neighbors


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4017522&oldid=17726098"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 02:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki