Finding the upper envelope of n line segments in O(n log n) time 论文

1989Information Processing Letters引用 273
Computational Geometry and Mesh GenerationAlgorithms and Data CompressionOptimization and Packing Problems