P-COMPLETE GEOMETRIC PROBLEMS

DOI10.1142/S0218195993000282zbMath0803.68046OpenAlexW2160751058MaRDI QIDQ4289637

Paul B. Callahan, Mikhail J. Atallah, Michael T. Goodrich

Publication date: 2 January 1995

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

Full work available at URL: https://doi.org/10.1142/s0218195993000282

zbMATH Keywords

parallel computationparallel algorithmscomputational geometryP-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (4)

Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound ⋮ Upper envelope onion peeling ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

This page was built for publication: P-COMPLETE GEOMETRIC PROBLEMS