2002
DOI: 10.1007/3-540-45782-8_12
|View full text |Cite
|
Sign up to set email alerts
|

The Euler Number of Discretized Sets — On the Choice of Adjacency in Homogeneous Lattices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
48
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 26 publications
(48 citation statements)
references
References 24 publications
0
48
0
Order By: Relevance
“…For n = 3 we recall the adjacency systems F 6 , F 14.1 , F 14.2 , and F 26 considered in detail in Ohser et al (2002;.…”
Section: Adjacency and Euler Numbermentioning
confidence: 99%
See 4 more Smart Citations
“…For n = 3 we recall the adjacency systems F 6 , F 14.1 , F 14.2 , and F 26 considered in detail in Ohser et al (2002;.…”
Section: Adjacency and Euler Numbermentioning
confidence: 99%
“…As in Ohser et al (2002;; Schladitz et al (2006) we approximate X by a discretisation X ⊓ F w. r. t. an adjacency system F. Since the set X ⊓F forms a (not necessarily convex) polyhedron, the number #F j (X ⊓ F) of elements of F j (X ⊓ F) is finite and, therefore, the Euler number χ(X ⊓ F) can be computed via the Euler-Poincaré formula,…”
Section: Definitionmentioning
confidence: 99%
See 3 more Smart Citations