A uniqueness theorem for Delaunay graphs

DOI10.1134/S0037446613030105MaRDI QIDQ359369zbMATH OpenFDO

Authors A. M. Gurin

Publication date 12 August 2013

Published in Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

combinatorial structureDelaunay domainDelaunay graphisomorphic graphsVoronoi domain

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Polytopes and polyhedra (52B99)

Recommendations

• Characterizing Delaunay graphs via fixed point theorem: a simple proof
• Toughness and Delaunay triangulations
• Delaunay graphs are almost as good as complete graphs
• An upper bound for conforming Delaunay triangulations
• Generalized Delaunay triangulation for planar graphs

Cites work

• On the history of the study of convex polyhedra with regular faces and faces composed of regular ones

Cited in

(3)

• Characterizing Delaunay graphs via fixed point theorem: a simple proof
• Uniqueness theorem for locally antipodal Delaunay sets
• Uniqueness in Harper's vertex-isoperimetric theorem

This page was built for publication: A uniqueness theorem for Delaunay graphs

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