Computational geometry: an introduction
Computational geometry: an introduction
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
A parallel circle-cover minimization algorithm
Information Processing Letters
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Two-Floodlight Illumination of Convex Polygons
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Parallel algorithms for geometric intersection graphs
Parallel algorithms for geometric intersection graphs
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Efficient algorithm for placing base stations by avoiding forbidden zone
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Covering and piercing disks with two centers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Covering and piercing disks with two centers
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |