Efficient algorithms for the minimum diameter bridge problem

DOI10.1016/S0925-7721(02)00045-7zbMath1013.68266OpenAlexW2020481758MaRDI QIDQ1869735

Takeshi Tokuyama

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00045-7

zbMATH Keywords

parametric methodsubquadratic time algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• Unnamed Item
• Unnamed Item
• On optimal bridges between two convex regions
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• A combinatorial bound for linear programming and related problems
• Minimax parametric optimization problems and multi-dimensional parametric searching
• Computing the optimal bridge between two polygons

This page was built for publication: Efficient algorithms for the minimum diameter bridge problem