Consistent Normal Orientation for Polygonal Meshes

  • Authors:
  • Pavel Borodin;Gabriel Zachmann;Reinhard Klein

  • Affiliations:
  • University of Bonn;University of Bonn;University of Bonn

  • Venue:
  • CGI '04 Proceedings of the Computer Graphics International
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new method that can consistentlyorient all normals of any mesh (if at all possible),while ensuring that most polygons are seen with theirfront-faces from most viewpoints. Our algorithm combinesthe proximity-based with a new visibility-based approach.Thus, it virtually eliminates the problems of proximity-basedapproaches, while avoiding the limitations of previoussolid-based approaches.Our new method builds a connectivity graph of thepatches of the model, which encodes the "proximity" ofneighboring patches. In addition, it augments this graphwith two visibility coefficients for each patch. Based onthis graph, a global consistent orientation of all patches isquickly found by a greedy optimization.We have tested our new method with a large suite of models,many of which from the automotive industry. The resultsshow that almost all models can be oriented consistentlyand sensibly using our new algorithm.