Worst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection

Can C. Ă–zturan. Worst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection. In Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, PPSC 1997, March 14-17, 1997, Hyatt Regency Minneapolis on Nicollel Mall Hotel, Minneapolis, Minnesota, USA. SIAM, 1997.

Abstract

Abstract is missing.