DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS
From MaRDI portal
Publication:3765246
DOI10.1108/eb010019zbMath0628.68043MaRDI QIDQ3765246
Publication date: 1986
Published in: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/eb010019
Voronoi diagram; computational geometry; Scharfetter-Gummel method; Delaunay partitioning; tetrahedral partitioning
68Q25: Analysis of algorithms and problem complexity
52A37: Other problems of combinatorial convexity
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
Cites Work
- Unnamed Item
- Delaunay triangulation and the convex hull of n points in expected linear time
- ANALYSIS OF A DISCRETIZATION ALGORITHM FOR STATIONARY CONTINUITY EQUATIONS IN SEMICONDUCTOR DEVICE MODELS
- ANALYSIS OF A DISCRETIZATION ALGORITHM FOR STATIONARY CONTINUITY EQUATIONS IN SEMICONDUCTOR DEVICE MODELS, II
- ANALYSIS OF A DISCRETIZATION ALGORITHM FOR STATIONARY EQUATIONS IN SEMICONDUCTOR DEVICE MODELS, III
- Computing Dirichlet Tessellations in the Plane