Computational geometry: an introduction
Computational geometry: an introduction
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
An efficient parallel algorithm for the row minima of a totally monotone matrix
Journal of Algorithms
More efficient parallel totally monotone matrix searching
Journal of Algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Placing two disks in a convex polygon
Information Processing Letters
Algorithms for Packing Two Circles in a Convex Polygon
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Computational geometry.
Three problems about simple polygons
Computational Geometry: Theory and Applications
Three problems about simple polygons
Computational Geometry: Theory and Applications
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
| Hi-index | 0.00 |
We present two algorithms for packing two largest disks in a polygon. The first algorithm locates two disks in a simple polygon in time O(n log2 n) improving the best previous deterministic result (Bespamyatnikh, 1999) by a factor of log n. The second algorithm finds two disks in a convex polygon such that the disks are separated by a diagonal of the polygon. It runs in time O(n log2 n) improving previous result (Kim et al., 2000) by a linear factor.