Combinatorial and computational geometry
Jacob E. Goodman, Janos Pach, Emo Welzl
During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This volume, which contains 32 papers on a broad range of topics of current interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.
Категории:
Година:
2005
Издателство:
Cambridge University Press
Език:
english
Страници:
626
ISBN 10:
0521848628
ISBN 13:
9780521848626
Серия:
Mathematical Sciences Research Institute publications 52
Файл:
PDF, 6.18 MB
IPFS:
,
english, 2005
Amazon 
Barnes & Noble 
Bookshop.org
Искате ли да добавите книжарница? Свържете се с нас на support@z-lib.do
Конвертиране на файлове
Още резултати от търсенето
Други предимства 
