AbstractThis note describes improvements to the Suhara‐Fukuda method for generating a triangular finite element network. These are based on the use of a node generation procedure which distributes nodes is a regular pattern across the network area and is sufficiently flexible to permit any variation in element density. Because of the regular node distribution, poorly shaped elements will not arise and so the procedure for connecting the nodes to form elements can be simplified. Examples of networks generaed in this way are give