947 search results - page 67 / 190 » Discrete Geometry |
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
DGCI
2006
Springer
15 years 1 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...
DGCI
2006
Springer
15 years 1 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
DGCI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Existing theories on shape digitization impose strong constraints on feasible shapes and require error-free measurements. We use Delaunay triangulation and -shapes to pro...
DGCI
2006
Springer
15 years 1 months ago
2006
Springer
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and...