Efficient algorithms for the minimum diameter bridge problem

Takeshi Tokuyama

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 algorithm. If only vertices are given, we give a subquadratic time algorithm, and if only halfspaces are given, we give a quadratic time algorithm.

Original languageEnglish
Pages (from-to)11-18
Number of pages8
JournalComputational Geometry: Theory and Applications
Issue number1
Publication statusPublished - 2003 Jan


  • Diameter
  • Distance
  • Parametric method

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Efficient algorithms for the minimum diameter bridge problem'. Together they form a unique fingerprint.

Cite this