1274 search results - page 65 / 255 » The Geometry of Coin-Weighing Problems |
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
CAGD
2010
13 years 10 months ago
2010
Many problems in computer aided geometric design and geometry processing are stated as least