Geometry-Conforming Grid Point Cloud Triangulation



next up previous contents index
Next: Interpolation Up: 6.7.2 Test and Demonstration Previous: Boundary-Boundary Triangulation

Geometry-Conforming Grid Point Cloud Triangulation

In Figure 6.38 a geometry consisting of multiple segments and a already existing grid has been re-triangulated by VORONOI. The jagged contour of the segment which bears the grid is produced by the simulation of the lithography step.

  
Figure: The PIF editor showing a detail of a resist mask edge geometry which has been re-triangulated by VORONOI

The example in Figure 6.39 has been generated by superimposing a (non geometry-conforming) regular triangular grid point cloud which covers the entire superscribed rectangular area with the geometry of Figure 6.37. According to Algorithm 6.4, VORONOI has automatically discarded all outside grid points (outside Austria and inside Vienna) during the Segmentation step (Algorithm 6.4) to generate the final triangular grid. The CPU time required by VORONOI for the solution of this problem on a PC 486 (DX2, 66Mhz) (running Linux 1.0) is 12 seconds.

  
Figure: The multiply connected geometry of Austria without Vienna, bearing a triangular grid which was generated by VORONOI



Martin Stiftinger
Thu Oct 13 13:51:43 MET 1994