✦ LIBER ✦

An algorithm for finding planar surfaces in three-manifolds

✍ Scribed by E. A. Sbrodova

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 98 KB
Volume: 144
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-007-0288-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for finding an induced cycle

Algorithms for finding an induced cycle in planar graphs

✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 369 KB

An algorithm for finding a large indepen

An algorithm for finding a large independent set in planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

An algorithm for the planar three-index

An algorithm for the planar three-index assignment problem

✍ D. Magos; P. Miliotis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 743 KB

An optimal algorithm for finding an encl

An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width

✍ Olga N. Gluchshenko; Horst W. Hamacher; Arie Tamir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem.

Curvature estimates for CMC surfaces in

Curvature estimates for CMC surfaces in three dimensional manifolds

✍ Sirong Zhang 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 French ⚖ 152 KB

An algorithm for finding the intersectio

An algorithm for finding the intersection lines between two B-spline surfaces

✍ Q.S. Peng 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 553 KB