scientific article; zbMATH DE number 2079391

MaRDI QIDQ4471350zbMATH OpenFDO

Authors Sergei Bespamyatnikh

Publication date 28 July 2004

Mathematics Subject Classification ID

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

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

Cited in

(16)

• scientific article; zbMATH DE number 1947410 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 2077086 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Shortest paths in arbitrary plane domains
• Testing homotopy for paths in the plane
• On the complexity of optimal homotopies
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• scientific article; zbMATH DE number 177559 (Why is no real title available?)
• Computing optimal homotopies over a spiked plane with polygonal boundary
• scientific article; zbMATH DE number 124663 (Why is no real title available?)
• scientific article; zbMATH DE number 4201495 (Why is no real title available?)
• 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)