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

On parallel computation of Voronoi diagrams

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

DOI10.1016/0167-8191(89)90011-2zbMath0677.68014OpenAlexW1996514667MaRDI QIDQ1123595

David J. Evans, Ivan Stojmenović

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90011-2


zbMATH Keywords

parallel algorithmsVoronoi diagramsshared memory parallel computer


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Theory of operating systems (68N25)


Related Items (3)

Voronoi-like partition of lattice in cellular automata ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ A nearly optimal deterministic parallel Voronoi diagram algorithm







This page was built for publication: On parallel computation of Voronoi diagrams

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1123595&oldid=13178069"
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:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki