Strong regularity of a family of face-to-face partitions generated by the longest-edge bisection algorithm


We examine the longest-edge bisection algorithm which chooses for bisection the longest edge in a given face-to-face simplicial partition of a bounded polytopic domain in R. Dividing this edge at its midpoint we define a locally refined partition of all simplices that surround this edge. Repeating this process, we obtain a family F = {Th}h→0 of nested face… (More)

7 Figures and Tables


  • Presentations referencing similar topics