TY - GEN

T1 - Efficient algorithms for the minimum diameter bridge problem

AU - Tokuyama, Takeshi

PY - 2001

Y1 - 2001

N2 - We give efficient algorithms for constructing a bridge between two convex regions in a fixed dimensional space so that the diameter of the bridged region is minimized. If both the set of vertices and the set of halfspaces defining the facets of the convex regions are given, we have an optimal linear time randomized algorithm. In only vertices are given, we give a subquadratic time algorithm, and if only halfspaces are given, we give a quadratic time algorithm.

AB - We give efficient algorithms for constructing a bridge between two convex regions in a fixed dimensional space so that the diameter of the bridged region is minimized. If both the set of vertices and the set of halfspaces defining the facets of the convex regions are given, we have an optimal linear time randomized algorithm. In only vertices are given, we give a subquadratic time algorithm, and if only halfspaces are given, we give a quadratic time algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84974707604&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84974707604&partnerID=8YFLogxK

U2 - 10.1007/3-540-47738-1_34

DO - 10.1007/3-540-47738-1_34

M3 - Conference contribution

AN - SCOPUS:84974707604

SN - 9783540477389

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 362

EP - 369

BT - Discrete and Computational Geometry - Japanese Conference, JCDCG 2000, Revised Papers

A2 - Akiyama, Jin

A2 - Kano, Mikio

A2 - Urabe, Masatsugu

PB - Springer Verlag

T2 - Japanese Conference on Discrete and Computational Geometry, JCDCG 2000

Y2 - 22 November 2000 through 25 November 2000

ER -