
doi: 10.1108/eb010019
An algorithm for Delaunay partitioning in three dimensions is given, and its use in numerical semiconductor models is examined. In particular, tetrahedral elements are found to be compatible with the Scharfetter‐Gummel discretization of the stationary continuity equations associated with such models, using the Voronoi cross‐sections for each edge in the obtained network. For tetrahedral elements, however, the Voronoi cross‐sections do not coincide with those previously shown to be compatible with the Scharfetter‐Gummel method.
Analysis of algorithms and problem complexity, tetrahedral partitioning, computational geometry, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Other problems of combinatorial convexity, Scharfetter-Gummel method, Delaunay partitioning, Voronoi diagram
Analysis of algorithms and problem complexity, tetrahedral partitioning, computational geometry, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Other problems of combinatorial convexity, Scharfetter-Gummel method, Delaunay partitioning, Voronoi diagram
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
