Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements

Authors:
Ketan Mulmuley
Affiliations:
-
Venue:
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Year:
1993

Citing 0
Cited 4

Optimization over k-set Polytopes and Efficient k-set Enumeration

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Sublinear geometric algorithms

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the bichromatic k-set problem

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the bichromatic k-set problem

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract