A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (Q5175985)

From MaRDI portal
scientific article; zbMATH DE number 6409726
Language Label Description Also known as
English
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
scientific article; zbMATH DE number 6409726

    Statements

    A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (English)
    0 references
    0 references
    0 references
    27 February 2015
    0 references
    Voronoi diagram
    0 references
    bisector
    0 references
    complexity
    0 references
    convex distance function
    0 references
    convex polytope
    0 references
    lower envelope
    0 references
    polyhedron
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references