Characterizing Delaunay graphs via fixed point theorem: a simple proof

DOI10.15807/JORSJ.61.151MaRDI QIDQ4642061zbMATH OpenOpenAlexFDO

Authors Yuichiro Miyamoto, Tomomi Matsui

Publication date 18 May 2018

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.61.151

zbMATH Keywords

Delaunay graphfixed point theoremgraph theorylinear programming

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computational aspects related to convexity (52B55) Linear programming (90C05)

Recommendations

• A uniqueness theorem for Delaunay graphs
• scientific article; zbMATH DE number 6379407
• Generalized Delaunay triangulation for planar graphs
• Formal study of plane Delaunay triangulation
• Simpler proof of a realizability theorem on Delaunay triangulations

Cited in

(3)

• A uniqueness theorem for Delaunay graphs
• A short proof of the toughness of Delaunay triangulations
• A weak characterisation of the Delaunay triangulation

This page was built for publication: Characterizing Delaunay graphs via fixed point theorem: a simple proof

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