1879 search results - page 27 / 376 » Computational geometry algorithms library |
107
click to vote
COMPGEOM
2004
ACM
15 years 4 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
146
click to vote
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
104
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
106
click to vote
CGF
2005
15 years 1 months ago
2005
The point set is a flexible surface representation suitable for both geometry processing and real-time rendering. In most applications, the control of the point cloud density is c...
111
Voted
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
We study the problem of estimating the epipolar geometry
from apparent contours of smooth curved surfaces
with affine camera models. Since apparent contours are
viewpoint depend...