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

scientific article

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

zbMath0644.68067MaRDI QIDQ3787486

Hubert Wagener

Publication date: 1986


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex hullvisibilitylinear time algorithmssimple polygonparallel computational geometryasymptotical optimal speedupconcurrent-read- exclusive-write parallel access machine modelhalfplane intersectionmaximally parallel algorithmspolygonal ordertwo-dimensional geometric problemsvector graphic


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Convex sets in (2) dimensions (including convex curves) (52A10) Software, source code, etc. for problems pertaining to geometry (51-04) Algorithms in computer science (68W99)


Related Items (2)

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon ⋮ A nearly parallel algorithm for the Voronoi diagram of a convex polygon







This page was built for publication:

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