𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for the Euler characteristic and related additive functionals of digital objects

✍ Scribed by H Bieri; W Nef


Publisher
Elsevier Science
Year
1984
Weight
93 KB
Volume
27
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Computing the Euler characteristic and r
✍ H Bieri πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science βš– 703 KB

A recursive algorithm for the computation of the Euler characteristic 5, the volume V, the surface S, the mean width M, and other properties (i.e., quermassintegrals) of digital pictures is presented. Full generality with respect to dimension is achieved by understanding digital pictures as (nondege

Index of a point of 3-D digital binary i
✍ Alexander I. Bykov; Leonid G. Zerkalov; Mario A. Rodrı́guez Pineda πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 104 KB

In this work a concept of index of a point of a 3-D (26, 6) digital image is defined. Basing on this concept a new characterization of the so-called simple points [1] as well as an algorithm for computing Euler characteristics of 3-D (26, 6) digital pictures is proposed.

The Continued Fraction Algorithm and Reg
✍ Robert J. Zuccherato πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 316 KB

The continued fraction expansion and infrastructure for quadratic congruence function fields of odd characteristic have been well studied. Recently, these ideas have even been used to produce cryptosystems. Much less is known concerning the continued fraction expansion and infrastructure for quadrat

Two new algorithms for solving optimizat
✍ Ali Abbasi Molai πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 877 KB

This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio

An extrapolation technique for predictin
✍ Sourav Chakravarty; Raj Mittra; Elif Aydin πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 374 KB πŸ‘ 2 views

A simple solution for the wavelength-routing assignment problem has been presented. This solution relies on a basic algorithm, and the first aim of the solution is either to propose a minimum delay path or, as far as possible, to minimize the number of wavelengths in the network. The solution also r