Efficient algorithms for the minimum diameter bridge problem

DOI10.1016/S0925-7721(02)00045-7zbMATH Open1013.68266OpenAlexW2020481758MaRDI QIDQ1869735FDOQ1869735

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

Recommendations

• scientific article; zbMATH DE number 1786529
• On optimal bridges between two convex regions
• Computing the optimal bridge between two convex polygons
• Computing the optimal bridge between two polygons
• On computing the optimal bridge between two convex polygons.

zbMATH Keywords

parametric methodsubquadratic time algorithm

Mathematics Subject Classification ID

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

Cites Work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• A combinatorial bound for linear programming and related problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimax parametric optimization problems and multi-dimensional parametric searching
• On optimal bridges between two convex regions
• Computing the optimal bridge between two polygons

Cited In (7)

• Efficient systolic algorithm for finding bridges in a connected graph
• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
• Effective method for constrained minimum - reverse bridge theorem
• Title not available (Why is that?)
• Computing the optimal bridge between two polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869735)