Angel R. Francés
University of Zaragoza
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Angel R. Francés.
discrete geometry for computer imagery | 1997
R. Ayala; Eladio Domínguez; Angel R. Francés; A. Quintero
In this paper a notion of lighting function is introduced as an axiomatized formalization of the “face membership rules” suggested by Kovalevsky. These functions are defined in the context of the framework for digital topology previously developed by the authors. This enlarged framework provides the (α, β)-connectedness (α, β e {6,18, 26}) defined on ℤ3 within the graph-based approach to digital topology. Furthermore, the Kong-Roscoe (α, β)-surfaces, with (α, β) ≠ (6, 6), (18, 6), are also found as particular cases of a more general notion of digital surface.
discrete geometry for computer imagery | 1996
R. Ayala; Eladio Domínguez; Angel R. Francés; A. Quintero
The goal of this paper is to determine the components of the complement of digital manifolds in the standard cubical decomposition of Euclidean spaces for arbitrary dimensions. Our main result generalizes the Morgenthaler-Rosenfelds one for (26, 6)-surfaces in ℤ3 [9]. The proof of this generalization is based on a new approach to digital topology sketched in [5] and developed in [2].
discrete geometry for computer imagery | 2008
Rémy Malgouyres; Angel R. Francés
We show that determining whether or not a simplicial 2- complex collapses to a point is deterministic polynomial time decidable. We do this by solving the problem of constructively deciding whether a simplicial 2-complex collapses to a 1-complex. We show that this proof cannot be extended to the 3D case, by proving that deciding whether a simplicial 3-complex collapses to a 1-complex is an NP-complete problem.
International Journal of Pattern Recognition and Artificial Intelligence | 2001
Eladio Domínguez; Angel R. Francés; R. Ayala; A. Quintero
This paper is devoted to state and prove a Digital Index Theorem for digital (n - 1)-manifolds in a digital space (Rn, f), where f belongs to a large family of lighting functions on the standard cubical decomposition Rn of the n-dimensional Euclidean space. As an immediate consequence we obtain the corresponding theorems for all (α, β)-surfaces of Kong–Roscoe, with α, β ∈ {6, 18, 26} and (α, β) ≠ (6, 6), (18, 26), (26, 26), as well as for the strong 26-surfaces of Bertrand–Malgouyres.
discrete geometry for computer imagery | 2002
Jose C. Ciria; Eladio Domínguez; Angel R. Francés
The main goal of this paper is to prove a Digital Jordan-Brouwer Theorem and an Index Theorem for simplicity 26-surfaces. For this, we follow the approach to Digital Topology introduced in [2], and find a digital space such that the continuous analogue of each simplicity 26-surface is a combinatorial 2-manifold. Thus, the separation theorems quoted above turn out to be an immediate consequence of the general results obtained in [2] and [3] for arbitrary digital n-manifolds.
international workshop on combinatorial image analysis | 2004
Jose C. Ciria; A. De Miguel; Eladio Domínguez; Angel R. Francés; A. Quintero
In the class
Lecture Notes in Computer Science | 2001
Eladio Domínguez; Angel R. Francés
\mathcal{H}
Image and Vision Computing | 2007
Jose C. Ciria; A. De Miguel; Eladio Domínguez; Angel R. Francés; A. Quintero
of (26,6)–connected homogeneous digital spaces on R3 we find a digital space EU with the largest set of digital surfaces in that class. That is, if a digital objet S is a digital surface in any space
discrete geometry for computer imagery | 1999
R. Ayala; Eladio Domínguez; Angel R. Francés; A. Quintero
E \epsilon \mathcal{H}
Pattern Recognition Letters | 2012
Jose C. Ciria; Eladio Domínguez; Angel R. Francés; A. Quintero
then S is a digital surface in EU too.