Stable Delaunay graphs

DOI10.1007/S00454-015-9730-XzbMATH Open1329.05072OpenAlexW2145009223MaRDI QIDQ908210FDOQ908210

Authors: N. E. Zubov 

Publication date: 3 February 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-015-9730-x

Recommendations

• Kinetic stable Delaunay graphs
• The stability of Delaunay triangulations
• Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
• Kinetic pie Delaunay graph and its applications
• Static and kinetic geometric spanners with applications

zbMATH Keywords

Delaunay triangulationVoronoi diagrambisectorconvex distance functionkinetic data structuremoving points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52B99)

Cites Work

• Voronoi diagrams and Delaunay triangulations
• Title not available (Why is that?)
• Data Structures for Mobile Data
• Surface reconstruction by Voronoi filtering
• Title not available (Why is that?)
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Kinetic stable Delaunay graphs
• A kinetic triangulation scheme for moving points in the plane
• A two-dimensional kinetic triangulation with near-quadratic topological changes
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• A simple, faster method for kinetic proximity problems
• Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions

Cited In (8)

• Euclidean minimum spanning trees with independent and dependent geometric uncertainties
• Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• Kinetic stable Delaunay graphs
• On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
• The stability of Delaunay triangulations
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
• Roaming regions for Delaunay nodes

This page was built for publication: Stable Delaunay graphs

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