✦ LIBER ✦

Tightness and computing distances in the curve complex

✍ Scribed by Shackleton, Kenneth J.

Book ID: 118798556
Publisher: Springer
Year: 2011
Tongue: English
Weight: 299 KB
Volume: 160
Category: Article
ISSN: 0046-5755
DOI: 10.1007/s10711-011-9680-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight geodesics in the curve complex

✍ Brian H. Bowditch 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 269 KB

Computing the Hausdorff distance between

Computing the Hausdorff distance between two B-spline curves

✍ Xiao-Diao Chen; Weiyin Ma; Gang Xu; Jean-Claude Paul 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 777 KB

This paper presents a geometric pruning method for computing the Hausdorff distance between two B-spline curves. It presents a heuristic method for obtaining the one-sided Hausdorff distance in some interval as a lower bound of the Hausdorff distance, which is also possibly the exact Hausdorff dista

Distance in the curve graph

✍ Hamenstädt, Ursula 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 182 KB

The complexity of computing the Muirhead

The complexity of computing the Muirhead–Dalton distance

✍ Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 259 KB

On the complexity of computing the Hausd

On the complexity of computing the Hausdorff distance

✍ Ko, Ker-I 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Tight Distance-regular Graphs and the Su

Tight Distance-regular Graphs and the Subconstituent Algebra

✍ Junie T. Go; Paul Terwilliger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 427 KB