scientific article; zbMATH DE number 1786529

MaRDI QIDQ4547824zbMATH OpenFDO

Authors Takeshi Tokuyama

Publication date 21 August 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2098/20980362

Mathematics Subject Classification ID

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

Recommendations

• Efficient algorithms for the minimum diameter bridge problem
• 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.

Cited in

(5)

• 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
• Efficient algorithms for the minimum diameter bridge problem
• Effective method for constrained minimum - reverse bridge theorem
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS

This page was built for publication:

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