scientific article; zbMATH DE number 4050997

MaRDI QIDQ3787486zbMATH OpenFDO

Authors Hubert Wagener

Publication date 1986

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

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

Recommendations

• scientific article; zbMATH DE number 1256697
• Sequential and parallel algorithms for finding a maximum convex polygon
• Parallel computational geometry
• Efficient parallel convex hull algorithms
• Optimal parallel hypercube algorithms for polygon problems

Cited in

(10)

• Optimal parallel hypercube algorithms for polygon problems
• scientific article; zbMATH DE number 4016210 (Why is no real title available?)
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• Parallel computational geometry
• A parallel algorithm for computing polygon set operations
• Parallel algorithms for some functions of two convex polygons
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• scientific article; zbMATH DE number 4170050 (Why is no real title available?)
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon
• scientific article; zbMATH DE number 1796953 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787486)