Sciweavers

557 search results - page 14 / 112
» On the set multi-cover problem in geometric settings
Sort
View
FSTTCS
2004
Springer
14 years 1 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
14 years 2 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito
COMPGEOM
2010
ACM
14 years 24 days ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
CG
2008
Springer
13 years 7 months ago
Masked photo blending: Mapping dense photographic data set on high-resolution sampled 3D models
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
Marco Callieri, Paolo Cignoni, Massimiliano Corsin...
ECCV
2010
Springer
14 years 6 days ago
Analyzing Depth from Coded Aperture Sets
Computational depth estimation is a central task in computer vision and graphics. A large variety of strategies have been introduced in the past relying on viewpoint variations, de...