947 search results - page 139 / 190 » Discrete Geometry |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients ...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
Topology is a fundamental property of shapes in pictures. Since the input for any image analysis algorithm is a digital image, which does not need to have the same topological char...