Hierarchical Delaunay triangulation for meshing

  • Authors:
  • Shu Ye;Karen Daniels

  • Affiliations:
  • Department of Computer Science, University of Massachusetts, Lowell;Department of Computer Science, University of Massachusetts, Lowell

  • Venue:
  • SEA'11 Proceedings of the 10th international conference on Experimental algorithms
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses an elliptical pad structure and its polygonal approximation. The elliptical pad is a part of via model structures, which are important and critical components on today's multilayered Printed Circuit Board (PCB) and electrical packaging. To explore meshing characterization of the elliptical pad helps mesh generation over 3D structures for electromagnetic modeling (EM) and simulation on PCB and electrical packaging. Because elliptical structures are often key PCB features, we introduce a hierarchical mesh construct and show that it has several useful Delaunay quality characteristics. Then we show experimentally that Computational Geometry Algorithm Library's (CGAL) meshing of an elliptical structure at different resolution levels and with various aspect ratios produces patterns similar to our construct. In particular, our experiment also shows that the result of meshing is not only constrained Delaunay triangulation but also Delaunay triangulation.