Voronoi diagrams — a survey of a fundamental geometric data structure
Franz Aurenhammer
Computing Surveys
23:345–406, 1991
Cites:
Finding the $k$ smallest spanning trees
Provably good mesh generation
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine