Dynamic Voronoi diagrams

DOI10.1109/TIT.1983.1056738MaRDI QIDQ3665003zbMATH OpenOpenAlexFDO

Authors Ihor G. Gowda, Amnon Naamad, David 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)

Cited in

(8)

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

This page was built for publication: Dynamic Voronoi diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3665003)