Dual Contouring for Domains with Topology Ambiguity

This paper describes an automatic and robust approach to generate quality triangular meshes for complicated domains with topology ambiguity. In previous works, we developed an octree-based Dual Contouring (DC) method to construct triangular meshes for complicated domains. However, topology ambiguity exists and causes non-conformal meshes. In this study, we discuss all possible topology configurations and develop an extension of DC which guarantees the correct topology. We first generate one base mesh with the previous DC method. Then we analyze all the octree leaf cells and categorize them into 31 topology groups. In order to discriminate these cells, we compute the values of their face and body saddle points based on a tri-linear representation inside the cells. Knowing the correct categorization, we are able to modify the base mesh and introduce more minimizer points within the same cell. With these minimizer points we update the mesh connectivities to preserve the correct topology. Finally we use a Laplacian smoothing technique to improve the mesh quality. Our main contribution is the topology categorization and mesh modification. We have applied our algorithm to three complicated domains and obtained good results.