COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Watershed segmentation of spectral images is typically achieved by first transforming the high-dimensional input data into a scalar boundary indicator map which is used ...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, a structural property of the set of lozenge tilings of a 2n-gon is highlighted. We introduce a simple combinatorial value called Hamming-distance, which is a lower b...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We estimate the frequency of the patterns in the discretization of parabolas, when the resolution tends to zero. We deduce that local estimators of length almost never co...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
In this report, we propose a new definition of the E2 DT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute...