scientific article; zbMATH DE number 2079391

zbMATH Open1092.68687MaRDI QIDQ4471350FDOQ4471350

Authors: Sergei Bespamyatnikh 

Publication date: 28 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• Computing homotopic shortest paths in the plane
• scientific article; zbMATH DE number 1947410
• Computing homotopic shortest paths efficiently
• Testing homotopy for paths in the plane
• Testing homotopy for paths in the plane

Mathematics Subject Classification ID

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

Cited In (16)

• Title not available (Why is that?)
• Computing homotopic shortest paths in the plane
• Computing minimum length paths of a given homotopy class
• Computing homotopic line simplification
• Testing homotopy for paths in the plane
• Title not available (Why is that?)
• LATIN 2004: Theoretical Informatics
• Shortest paths in arbitrary plane domains
• On the complexity of optimal homotopies
• Testing homotopy for paths in the plane
• Title not available (Why is that?)
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• Computing optimal homotopies over a spiked plane with polygonal boundary
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing homotopic shortest paths efficiently

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 Q4471350)