Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams

Explore this paper's citation graph

Summary

The maximin placement of a convex polygon P inside a polygon Q is shown, and the dynamic Voronoi diagram of rigidly moving sets of n points is investigated, showing the combinatorial complexity of this canonical dynamic diagram.

Type
article
Published
1990-05-01
Cited by
32
References
26
Access
Open access

Keywords

Voronoi diagram, Combinatorics, Minimax, Translation (biology), Regular polygon

References

Cited by

Related papers