947 search results - page 158 / 190 » Discrete Geometry |
SIGGRAPH
1996
ACM
15 years 1 months ago
1996
ACM
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
RT
1998
Springer
15 years 1 months ago
1998
Springer
Complex luminaries and lamp geometries can greatly increase the realism of synthetic images. Unfortunately, the correct rendering of illumination from complex lamps requires costly...
CVPR
2012
IEEE
13 years 3 days ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...