Kód: 09825519
Excerpt from Separating Two Simple Polygons, by a Sequence of Translations Let P and Q be two disjoint simple polygons having m and n sides respectively. We present an algorithm which determines whether Q can be moved by a sequ ... celý popis
13.19 €
Dostupnosť:
50 % šancaMáme informáciu, že by titul mohol byť dostupný. Na základe vašej objednávky sa ho pokúsime do 6 týždňov zabezpečiť.Zadajte do formulára e-mailovú adresu a akonáhle knihu naskladníme, zašleme vám o tom správu. Postrážime všetko za vás.
Nákupom získate 33 bodov
Excerpt from Separating Two Simple Polygons, by a Sequence of Translations Let P and Q be two disjoint simple polygons having m and n sides respectively. We present an algorithm which determines whether Q can be moved by a sequence of translations to a position sufficiently far from P without colliding with P, and which produces such a motion if it exists. Our algorithm runs in time 0(mn a(mn) log m log n) where a(k) is the extremely slowly growing inverse Ackermann's function. Since in the worst case (2(mn) translations may be necessary to separate Q from P, our algorithm is close to optimal. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Geometry
13.19 €
Osobný odber Bratislava a 2642 dalších
Copyright ©2008-24 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
Nákupný košík ( prázdny )