Correspondence to: G. Baciu As mesh refinement becomes a necessity in improving the quality of radiosity rendering, we must efficiently subdivide increasingly complex meshes. In triangulation (often the method chosen), each step may involve numerous proximity node searches, edge selections, additions, and deletions. In this context we show two variations of an efficient triangulation mechanism based on the advancing front paradigm. We point out where the computational bottlenecks occur and give the characteristics of the domain for which each method excels. While we have applied the advancing front mesh generation for the first time to radiosity rendering, the algorithms are general enough to be of interest in other domains of application.
- Finite elements
- Mesh generation
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design