1994•Lecture notes in computer scienceRequires access

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon

Piotr Berman, Andrzej Lingas

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Voronoi diagram, Combinatorics, Convex hull, Convex polygon, Binary logarithm, Log-log plot, Output-sensitive algorithm, Parallel algorithm

Back to paper search Browse research topics Original source

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon — Research Paper | ScholarLens