๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal algorithm for constructing the weighted voronoi diagram in the plane

โœ Scribed by F. Aurenhammer; H. Edelsbrunner

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
543 KB
Volume
17
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Grรถbner Basis of Binomial Ideals
โœ Ulla Koppenhagen; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced Grรถbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Grรถbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
โœ Ulla Koppenhagen; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

It is known that the reduced Grรถbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kรผhnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper