Stable Delaunay graphs

DOI10.1007/s00454-015-9730-xzbMath1329.05072OpenAlexW2145009223MaRDI QIDQ908210

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

zbMATH Keywords

bisectorVoronoi diagramDelaunay triangulationconvex distance functionkinetic data structuremoving points

Mathematics Subject Classification ID

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

Related Items (4)

Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ On Kinetic Delaunay Triangulations

Cites Work

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

This page was built for publication: Stable Delaunay graphs