4 citations · 9 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CG2020★ 1 cited
Optimal Algorithm for the Planar Two-Center Problem
Kyungjin Cho, Eunjin Oh, Haitao Wang +1
We study a fundamental problem in Computational Geometry, the planar two-center problem. In this problem, the input is a set of points in the plane and the goal is to find…
cs.CG2020
The Maximum-Level Vertex in an Arrangement of Lines
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn +2
Let be a set of lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement of maximum…