scientific article; zbMATH DE number 4114000

MaRDI QIDQ4729346zbMATH OpenFDO

Authors Thomas R. M. Fischer

Publication date 1989

zbMATH Keywords

combinatorial boundsmultidimensional computational geometryVoronoi diagrams

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4151859
• Higher-dimensional Voronoi diagrams in linear expected time
• New lower bounds for Hopcroft's problem
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions
• A tight bound for the complexity of Voroni diagrams under polyhedral convex distance functions in 3D

Cited in

(8)

• Upper and lower bounds for the Voronoi-Minkowski constant
• Theoretical lower bound for border length minimization problem
• scientific article; zbMATH DE number 1804772 (Why is no real title available?)
• scientific article; zbMATH DE number 3883608 (Why is no real title available?)
• scientific article; zbMATH DE number 4151859 (Why is no real title available?)
• scientific article; zbMATH DE number 3945384 (Why is no real title available?)
• scientific article; zbMATH DE number 3997167 (Why is no real title available?)
• A counterexample to a Voronoi region conjecture

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