Voronoi Diagram Distances

Michel Marie Deza and Elena Deza
Additional contact information
Michel Marie Deza: École Normale Supérieure
Elena Deza: Moscow State Pedagogical University

Chapter Chapter 20 in Encyclopedia of Distances, 2013, pp 339-347 from Springer

Abstract: Abstract Given a finite set A of objects A i in a space S, computing the Voronoi diagram of A means partitioning the space S into Voronoi regions V(A i ) in such a way that V(A i ) contains all points of S that are “closer” to A i than to any other object A j in A.

Keywords: Voronoi Diagram; Network Distance; Diagram Versus; Power Diagram; Voronoi Edge (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-30958-8_20

Ordering information: This item can be ordered from
http://www.springer.com/9783642309588

DOI: 10.1007/978-3-642-30958-8_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().