Valentin E. Brimkov; Reneta P. Barneva; Herbert A. Hauptman Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2008) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Jake K. Aggarwal (ed.); Reneta P. Barneva (ed.); Valentin E. Brimkov (ed.); Kostadin N. Koroutchev (ed.); Elka R Korutcheva Springer (2011) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Reneta P. Barneva; Valentin E. Brimkov; Jake K. Aggarwal Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2012) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Reneta P. Barneva; Bhargab B. Bhattacharya; Valentin E. Brimkov Springer International Publishing AG (2015) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Reneta P. Barneva; Valentin E. Brimkov; João Manuel R.S. Tavares Springer International Publishing AG (2017) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Reneta P. Barneva; Valentin E. Brimkov; Piotr Kulczycki; João Manuel R. S. Tavares Springer Nature Switzerland AG (2019) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Tibor Lukić; Reneta P. Barneva; Valentin E. Brimkov; Lidija Čomić; Nataša Sladoje Springer Nature Switzerland AG (2020) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Reneta P. Barneva; Valentin E. Brimkov; Herbert A. Hauptman; Renato M. Natal Jorge; Joao Tavares Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2010) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Springer Sivumäärä: 430 sivua Asu: Kovakantinen kirja Painos: 2012 Julkaisuvuosi: 2012, 21.05.2012 (lisätietoa) Kieli: Englanti
Digital geometry emerged as an independent discipline in the second half of the last century. It deals with geometric properties of digital objects and is developed with the unambiguous goal to provide rigorous theoretical foundations for devising new advanced approaches and algorithms for various problems of visual computing. Different aspects of digital geometry have been addressed in the literature. This book is the first one that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors. Every chapter contains a section in which interesting open problems are addressed.