Learn More
We study language-theoretical properties of the set of reducible ground terms and its complement-the set of ground normal forms induced by a g i v en rewriting system. As a tool for our analysis we i n troduce the property of nite irreducibility of a term with respect to a variable and prove it to be decidable. It turns out that this property generalizes(More)
In this paper, a new approach to the discretization of n-dimensional Euclidean figures is studied: the discretization of a compact Euclidean set K is a discrete set S whose Hausdorff distance to K is minimal; in particular such a discretization depends on the choice of a metric in the Euclidean space, for example the Euclidean or a chamfer distance. We call(More)
In this paper, we propose an original tree matching algorithm for intra-patient hepatic vascular system registration. The vascular systems are segmented from CT-Scan images acquired at different time, and then modeled as trees. The goal of this algorithm is to find common bifurcations (nodes) and vessels (edges) in both trees. Starting from the tree root,(More)
In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT-scan images acquired at different times, and then modeled as trees. The goal of this algorithm is to find common bifurcations (nodes) and vessels (edges) in both trees. Starting from the(More)