Efficient algorithms for the minimum diameter bridge problem

Takeshi Tokuyama

doi:10.1016/S0925-7721(02)00045-7

Efficient algorithms for the minimum diameter bridge problem

Takeshi Tokuyama

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

2 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 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 language	English
Pages (from-to)	11-18
Number of pages	8
Journal	Computational Geometry: Theory and Applications
Volume	24
Issue number	1
DOIs	https://doi.org/10.1016/S0925-7721(02)00045-7
Publication status	Published - 2003 Jan

Keywords

Diameter
Distance
Parametric method

ASJC Scopus subject areas

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

Access to Document

10.1016/S0925-7721(02)00045-7

Cite this

@article{d39641837e174e2dbeb1f3f372d53609,

title = "Efficient algorithms for the minimum diameter bridge problem",

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

keywords = "Diameter, Distance, Parametric method",

author = "Takeshi Tokuyama",

year = "2003",

month = jan,

doi = "10.1016/S0925-7721(02)00045-7",

language = "English",

volume = "24",

pages = "11--18",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Efficient algorithms for the minimum diameter bridge problem

AU - Tokuyama, Takeshi

PY - 2003/1

Y1 - 2003/1

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

KW - Diameter

KW - Distance

KW - Parametric method

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

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

U2 - 10.1016/S0925-7721(02)00045-7

DO - 10.1016/S0925-7721(02)00045-7

M3 - Article

AN - SCOPUS:84867966898

VL - 24

SP - 11

EP - 18

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 1

ER -

Efficient algorithms for the minimum diameter bridge problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this