scientific article; zbMATH DE number 403949

MaRDI QIDQ4201933zbMATH OpenFDO

Authors Rolf Klein, K. Mehlhorn, Stefan Meiser

Publication date 6 September 1993

zbMATH Keywords

abstract Voronoi diagrams

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the construction of abstract Voronoi diagrams
• scientific article; zbMATH DE number 18530
• Abstract Voronoi diagrams revisited
• scientific article; zbMATH DE number 4110186
• Dynamic construction of abstract Voronoi diagrams
• Concrete and abstract Voronoi diagrams
• scientific article; zbMATH DE number 4098181
• On the complexity of higher order abstract Voronoi diagrams
• On the complexity of higher order abstract Voronoi diagrams
• On the structural properties of Voronoi diagrams

Cited in

(20)

• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Voronoi diagrams on orbifolds
• Forest-like abstract Voronoi diagrams in linear time
• ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
• Abstract Voronoi diagrams with disconnected regions
• Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
• Abstract Voronoi diagrams from closed bisecting curves
• scientific article; zbMATH DE number 4098181 (Why is no real title available?)
• scientific article; zbMATH DE number 4110186 (Why is no real title available?)
• scientific article; zbMATH DE number 18530 (Why is no real title available?)
• scientific article; zbMATH DE number 219277 (Why is no real title available?)
• Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
• Divide-and-conquer for Voronoi diagrams revisited
• Abstract Voronoi-like graphs: extending Delaunay's theorem and applications
• Characterization of contour elements that generate abstract Voronoi diagrams
• Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
• Construction of Voronoi diagrams in the plane by using maps
• On the construction of abstract Voronoi diagrams
• Abstract Voronoi diagrams revisited
• Divide-and-conquer for Voronoi diagrams revisited

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 Q4201933)