103 search results - page 6 / 21 » An improved bound on the number of unit area triangles |
ADVIS
2000
Springer
14 years 5 days ago
2000
Springer
Modern applications demand support for a large number of clients and require large scale storage subsystems. This paper presents a theoretical model of prefetching and caching of s...
CGF
2006
13 years 7 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
ICCTA
2007
IEEE
14 years 2 months ago
2007
IEEE
The advent of advanced graphics technologies and improved hardware has enabled the generation of highly complex models with huge number of triangles. Point-based representations a...
VLSID
2009
IEEE
14 years 8 months ago
2009
IEEE
Increasing the number of cores in a multi-core processor reduces per-core performance. On the other hand, providing more resources to each core limits the number of cores on a chi...
JCSS
2008
13 years 7 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...