1274 search results - page 63 / 255 » The Geometry of Coin-Weighing Problems |
IMR
2004
Springer
14 years 3 months ago
2004
Springer
The aim of this paper is to study the feasibility of using (irreversible) entropy production as driving force for a moving mesh. Such a method should be able to capture or track p...
DGCI
2006
Springer
14 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 ...
COCOON
1999
Springer
14 years 2 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
SMA
2008
ACM
13 years 10 months ago
2008
ACM
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...