2 search results - page 1 / 1 » Space-Query-Time Tradeoff for Computing the Visibility Polyg... |
161
Voted
FAW
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
136
click to vote
SI3D
2009
ACM
15 years 10 months ago
2009
ACM
We present an approach for rendering the surface of particle-based fluids that is simple to implement, has real-time performance with a configurable speed/quality trade-off, and...