A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems

DOI10.1145/79505.79512zbMath0883.68114OpenAlexW2047116276MaRDI QIDQ4371752

Baltasar Cuevas Renaud, Oscar Palacios-Velez

Publication date: 9 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1990-16/

zbMATH Keywords

Delaunay triangulationsoriented walk

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Extracting and representing qualitative behaviors of complex systems in phase space, A data modeling abstraction for describing triangular mesh algorithms