895 search results - page 94 / 179 » Approximate convex decomposition |
152
click to vote
RT
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a technique, based on pre-computed light transport and separable BRDF approximation, for interactive rendering of non-diffuse objects under all-frequency envir...
170
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
218
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
182
click to vote
SIAMMAX
2010
15 years 20 days ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
183
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...