scientific article; zbMATH DE number 4151859

MaRDI QIDQ3481219zbMATH OpenFDO

Authors

Publication date 1990

zbMATH Keywords

all nearest neighbor problemlower boundsVoronoi diagrams

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 4114000
• The complexity of many cells in arrangements of planes and related problems
• The combinatorial and topological complexity of a single cell
• New lower bounds for Hopcroft's problem
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

Cited in

(9)

• Recognising polytopical cell complexes and constructing projection polyhedra
• An algorithm for cellular maps of closed surfaces
• Asymptotic number of \(\mathbb{Z}^3 \Delta\) cells covering \(\mathcal{C}^{(1)}\) surface on uniform grid and complexity of recursive-partitioning simulation of septal tissue regions
• scientific article; zbMATH DE number 3945384 (Why is no real title available?)
• scientific article; zbMATH DE number 4011939 (Why is no real title available?)
• scientific article; zbMATH DE number 177187 (Why is no real title available?)
• scientific article; zbMATH DE number 4114000 (Why is no real title available?)
• The complexity of many cells in arrangements of planes and related problems
• Thinning on cell complexes from polygonal tilings

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