10608 search results - page 680 / 2122 » Complexity of O'Hara's Algorithm |
195
click to vote
SI3D
1999
ACM
15 years 11 months ago
1999
ACM
We present a compact, image-based representation for threedimensional objects with complex shapes that can be rendered with correct perspective from arbitrary viewpoints using a l...
183
Voted
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
190
Voted
SIGGRAPH
1994
ACM
15 years 11 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
208
Voted
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
177
click to vote
IJCAI
2003
15 years 8 months ago
2003
In many applications of temporal reasoning we are in terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...