Delaunay and Voronoi tessellations and minimal simple cycles in triangular region and regular-3 undirected planar graphs

DOI10.1016/S0965-9978(00)00096-XzbMath1003.68573OpenAlexW2064302428MaRDI QIDQ1852121

G. M. Seed

Publication date: 9 January 2003

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0965-9978(00)00096-x

zbMATH Keywords

graph algorithmscomputational geometryDelaunay and Voronoi tessellations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (2)

ANALYTIC INVESTIGATIONS OF THE WALSH FUNCTIONS COMBINED WITH THE SUMUDU TRANSFORM AND APPLICATIONS TO THE TRANSPORT EQUATION ⋮ 2D and 3D finite element meshing and remeshing

This page was built for publication: Delaunay and Voronoi tessellations and minimal simple cycles in triangular region and regular-3 undirected planar graphs