Dynamic Voronoi diagrams

DOI10.1109/TIT.1983.1056738zbMath0516.94030OpenAlexW2142337286MaRDI QIDQ3665003

Amnon Naamad, Ihor G. Gowda, David G. Kirkpatrick, Der-Tsai Lee

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056738

zbMATH Keywords

Voronoi diagramsnearest neighbor searchminimum spanning circle problem

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Voronoi diagrams over dynamic scenes ⋮ COMPUTING CLOSEST POINTS FOR SEGMENTS ⋮ An efficient algorithm for the proximity connected two center problem ⋮ GPU based detection of topological changes in Voronoi diagrams ⋮ Unnamed Item ⋮ Voronoi diagram with visual restriction ⋮ \(k\)-balanced center location problem: a new multi-objective facility location problem ⋮ Voronoi diagrams with barriers and on polyhedra for minimal path planning

This page was built for publication: Dynamic Voronoi diagrams