Efficient algorithms for the minimum diameter bridge problem

Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationDiscrete and Computational Geometry - Japanese Conference, JCDCG 2000, Revised Papers
EditorsJin Akiyama, Mikio Kano, Masatsugu Urabe
PublisherSpringer Verlag
Pages362-369
Number of pages8
ISBN (Print)9783540477389
DOIs
Publication statusPublished - 2001
EventJapanese Conference on Discrete and Computational Geometry, JCDCG 2000 - Tokyo, Japan
Duration: 2000 Nov 222000 Nov 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2098
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherJapanese Conference on Discrete and Computational Geometry, JCDCG 2000
CountryJapan
CityTokyo
Period00/11/2200/11/25

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this