Triangulating Planar Graphs While Minimizing the Maximum Degree

Authors:
Goos Kant;Hans L. Bodlaender
Affiliations:
-;-
Venue:
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Year:
1992

Citing 0
Cited 2

Polygon decomposition for efficient construction of Minkowski sums

Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Polygon Decomposition for Efficient Construction of Minkowski Sums

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract