This method is particularly suited for the boundary representation of domains. If the boundary is continuous, it is discretised to give a piecewise linear curve (PLC) based roughly upon the number of triangles required in the domain. The initial front is a set of line segments defining the boundary completely. Usually, the internal and the external curves are specified in opposite sense in order to get a convergent algorithm. This is useful if new points are placed only on one side of the boundary as the curves are traversed in the specified sense. A method of selection of trial point which leads to direct graded triangulation is discussed here.