Chrysanthou Y. Shadow computation for 3D interactive and animation. Ph.D. Thesis, Department of Computer Science, College University of London, January 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....by the need to avoid disk to memory delays, it can be applied to avoid server to client delays for network based applications. However, his method is based on the cells and portals techniques which are effective for in door walkthroughs only. Other related work deals with shadow algorithms [3]. Regarding the viewpoint and its ffl neighborhood as an area light source, occlusion culling algorithms search for the primitives which are in the umbra. However, shadow algorithms are usually analytical and much too expensive to simply cull away the primitives in the umbra. Another class of ....

Y. Chrysanthou. Shadow Computation for 3D Interactive and Animation. PhD thesis, Department of Computer Science, College University of London, January 1996.

....adjacent cells or neighboring cells, as a function of scene density and cell size (Section 5) This estimate is necessary (i) to determine the optimal cell size and (ii) to design a space effective data structure. Generally speaking, exact visibility queries have a high computational complexity [11,12]. Several authors have developed approximate conservative visibility techniques, that is, techniques that compute a superset of the visibility set which includes all visible objects and perhaps some occluded objects. The advantage of such conservative sets is that they can be computed much faster ....

Y. Chrysanthou, Shadow Computation for 3D Interactive and Animation, Ph.D. thesis, Department of Computer Science, College University of London, January 1996.

No context found.

T. Ylonen. Shadow Paging is Feasible. Licentiate's Thesis, Helsinki University of Technology, Department of Computer Science, May 1994.

....to compete with the best log based systems. New algorithms have been developed to implement other desired features, such as fast snapshots (transaction consistent copies of the database) that can be used to do arbitrary read only transactions or on the fly dumping (backups) without any locking [16]. There are a number of application areas where shadow paging may offer important benefits compared to log based systems. Examples include embedded databases in telecommunications, where fast recovery can be extremely important, and decision support applications with large read only transactions ....

....is implemented, and discusses extended lock modes and index management. Section 5 gives performance results for the TPC B benchmark [2] Section 6 concludes the paper. Due to space constraints, snapshots and two phase commit are not considered in this paper; the interested reader is referred to [16]. 2 Page Table Level The general idea in shadow paging is that existing data is never overwritten, but instead modified pages are always written to new locations on disk, and a mapping is used to keep track of the current location of each page. The mapping is called the page table. All pointers ....

[Article contains additional citation context not shown here]

T. Ylonen. Shadow Paging Is Feasible. Licentiate's thesis, Department of Computer Science, Helsinki University of Technology, 1994. Available on WWW as http://www.cs.hut.fi/~ylo/techreports/lisuri.ps.

No context found.

Chrysanthou Y. Shadow computation for 3D interactive and animation. Ph.D. Thesis, Department of Computer Science, College University of London, January 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC