Accession Number : ADA322954

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

Descriptive Note : Contract rept.,

Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s) : Oezturan, Can

PDF Url : ADA322954

Report Date : DEC 1996

Pagination or Media Count : 12

Abstract : We present a logarithmic algorithm for performing parallel refinement of triangular meshes by the widely used longest edge bisection procedure. We show that the refinement propagation forms a data dependency which can be expressed as a forest of directed trees. We solve a parallel Euler Tour problem on the trees to propagate the refinement. After propagation, we apply refinement templates. Our algorithm improves earlier reported results which had linear worst case complexity.

Descriptors :   *ALGORITHMS, *PARALLEL PROCESSING, DATA MANAGEMENT, INPUT OUTPUT PROCESSING, MESH, EULER EQUATIONS, REFINING, TRIANGULATION.

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE