1274 search results - page 145 / 255 » The Geometry of Coin-Weighing Problems |
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
104
click to vote
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
130
Voted
DGCI
2000
Springer
15 years 4 months ago
2000
Springer
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
117
click to vote
DGCI
2009
Springer
15 years 4 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...