scientific article; zbMATH DE number 1555916
From MaRDI portal
Publication:4525679
zbMath0953.68604MaRDI QIDQ4525679
Publication date: 24 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (10)
Abstract Voronoi diagrams revisited ⋮ A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon ⋮ On selecting a fraction of leaves with disjoint neighborhoods in a plane tree ⋮ Deletion in abstract Voronoi diagrams in expected linear time and related problems ⋮ Forest-like abstract Voronoi diagrams in linear time ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Unnamed Item ⋮ A nearly parallel algorithm for the Voronoi diagram of a convex polygon ⋮ The geodesic farthest-point Voronoi diagram in a simple polygon ⋮ Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
This page was built for publication: