TY - JOUR
T1 - Computing a segment center for a planar point set
AU - Agarwal, Pankaj K.
AU - Efrat, Alon
AU - Sharir, Micha
AU - Toledo, Sivan
PY - 1993/9
Y1 - 1993/9
N2 - Given a set S of n points in the plane and a segment e, a center placement of e is a placement (allowing translation and rotation) that minimizes the maximum distance from e to the points of S. We present an algorithm for computing a center placement for S, whose running time is O(n2α(n)log3n), where α(n) is the inverse Ackermann function. The algorithm makes use of the parametric searching technique of Megiddo.
AB - Given a set S of n points in the plane and a segment e, a center placement of e is a placement (allowing translation and rotation) that minimizes the maximum distance from e to the points of S. We present an algorithm for computing a center placement for S, whose running time is O(n2α(n)log3n), where α(n) is the inverse Ackermann function. The algorithm makes use of the parametric searching technique of Megiddo.
UR - http://www.scopus.com/inward/record.url?scp=0001078023&partnerID=8YFLogxK
U2 - 10.1006/jagm.1993.1043
DO - 10.1006/jagm.1993.1043
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0001078023
SN - 0196-6774
VL - 15
SP - 314
EP - 323
JO - Journal of Algorithms
JF - Journal of Algorithms
IS - 2
ER -