Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments |
scientific article |
Statements
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (English)
0 references
27 June 2014
0 references
The Voronoi diagram is one of the most popular geometric structures that has been received remarkable and constant attention for several decades from not only computer science but also many different fields of science and engineering. The author establishes a tight bound on the worst-case combinatorial complexity of the farthest-color Voronoi diagram of line segments in the plane.
0 references
Voronoi diagram
0 references
line segments
0 references
farthest-color Voronoi diagram
0 references
Davenport-Schinzel sequence
0 references
tight bound
0 references
worst-case combinatorial complexity
0 references
