Longest-edge n-section algorithms : properties and open problems

Abstract

In this paper we survey all known (including own recent results) properties of the longest-edge nn-section algorithms. These algorithms (in classical and recently designed conforming form) are nowadays used in many applications, including finite element simulations, computer graphics, etc. as a reliable tool for controllable mesh generation. In addition, we present a list of open problems arising in and around this topic.