DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS

DOI10.1108/eb010019zbMath0628.68043OpenAlexW2058425046MaRDI QIDQ3765246

Michael Sever

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

zbMATH Keywords

Voronoi diagramcomputational geometryScharfetter-Gummel methodDelaunay partitioningtetrahedral partitioning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• 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
• Unnamed Item

This page was built for publication: DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS