Used together with:
tight
(1)
polyhedr
(1)
diagram
(1)
under
(1)
complex
(1)
Stem
voroni$ (
all stems
)
1 papers:
STOC-2001-IckingM
#3d
#bound
#complexity
#diagrams
#distance
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (
CI
,
LM
), pp. 316–321.
Bibliography of Software Language Engineering in Generated Hypertext
(
BibSLEIGH
) is created and maintained by
Dr. Vadim Zaytsev
.
Hosted as a part of
SLEBOK
on
GitHub
.