scientific article; zbMATH DE number 6379407

MaRDI QIDQ2933452zbMATH OpenFDO

Authors V. M. Tereshchenko

Publication date 10 December 2014

zbMATH Keywords

Delaunay triangulationincremental algorithmplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Generalized Delaunay triangulation for planar graphs
• A fast algorithm for constructing Delaunay triangulations in the plane
• Outerplanar graphs and Delaunay triangulations
• Constructing Delaunay Triangulations along Space-Filling Curves
• scientific article; zbMATH DE number 4174387
• Delaunay triangulation of arbitrarily shaped planar domains
• Construction of the Delaunay superlarge triangulation
• Computing correct Delaunay triangulations
• scientific article; zbMATH DE number 1240687

Cited in

(5)

• Generalized Delaunay triangulation for planar graphs
• scientific article; zbMATH DE number 5764872 (Why is no real title available?)
• Characterizing Delaunay graphs via fixed point theorem: a simple proof
• Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
• Formal study of plane Delaunay triangulation

This page was built for publication:

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