Boris Aronov – författare
Visar alla böcker från författaren Boris Aronov. Handla med fri frakt och snabb leverans.
6 produkter
6 produkter
Inbunden, Engelska, 2023
343 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2023
166 kr
Skickas inom 5-8 vardagar
Inbunden, Engelska, 2015
415 kr
Skickas inom 3-6 vardagar
1 928 kr
Skickas inom 10-15 vardagar
An impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the 'founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.
E-bok
PDF, Engelska, 20121 995 kr
Läs direkt efter köp
Häftad, Engelska, 2012
1 635 kr
Skickas inom 10-15 vardagar
An impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the 'founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.