Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors

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

DOI10.1007/PL00008263zbMath0943.68174OpenAlexW1988379288MaRDI QIDQ1125809

Binhai Zhu, Xiaotie Deng

Publication date: 3 January 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00008263



Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)


Related Items (2)

A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions ⋮ Classification using proximity catch digraphs






This page was built for publication: A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors

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