![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 624
Volume 624, April 2016
- Andrea Frosini, Simone Rinaldi:
Advances in Discrete Geometry for Computer Imagery: Preface. 1
- Henri-Alex Esbelin, Rémy Malgouyres:
Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results. 2-24 - Nilanjana Karmakar, Arindam Biswas
, Partha Bhowmick:
Reeb graph based segmentation of articulated components of 3D digital objects. 25-40 - Yan Gérard, Antoine Vacavant, Jean-Marie Favreau
:
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length. 41-55 - Ranita Biswas
, Partha Bhowmick:
From prima quadraginta octant to lattice sphere through primitive integer operations. 56-72 - Jacques-Olivier Lachaud, Xavier Provençal
, Tristan Roussillon:
An output-sensitive algorithm to compute the normal vector of a digital plane. 73-88 - Sara Brunetti
, Paolo Dulio
, Carla Peri:
On bounded additivity in discrete tomography. 89-100 - Eric Domenjoud, Xavier Provençal, Laurent Vuillon:
Palindromic language of thin discrete planes. 101-108 - Andrea Frosini, Veronica Guerrini, Simone Rinaldi
:
Geometric properties of matrices induced by pattern avoidance. 109-120 - Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay
:
Efficient operations on discrete paths. 121-135 - Stefano Brocchi, Paolo Dulio
, Silvia M. C. Pagani:
Reconstruction of convex polyominoes with a blocking component. 136-146
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.