See this document in CiteSeerX!

The power of a two-sided depth test and its application to CSG rendering  (Make Corrections)  
and depth extraction Category: Research Paper



  Home/Search   Context   Related

 
View or download:
stanford.edu/~kamesh/csg.pdf
att.com/~krishnas/MY_PA...i3d03_csg.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help
Problem Downloading?
From:  stanford.edu/~kamesh/pub (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In this paper, we explore the computational power provided by this second depth test, by demonstrating its utility in two separate applications. (Update)

Similar documents (at the sentence level):
9.3%:   Application of the Two-Sided Depth Test to CSG Rendering - Sudipto Guha Univ (2003)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Blister: GPU-based rendering of Boolean - Combinations Of Free-Form   (Correct)
0.5:   Linear-time CSG Rendering of Intersected Convex Objects - Stewart, Leach, John (2002)   (Correct)
0.4:   GVU TECH REPORT GT-GVU-06-16 1 CST: Constructive Solid.. - Rendering Breps And   (Correct)

Similar documents based on text:   More   All
0.6:   Interactive Order-Independent Transparency - Everitt (2001)   (Correct)
0.4:   Hardware Shadow Mapping - Everitt, Rege, Cebenoyan (2002)   (Correct)
0.3:   General Purpose Z-Buffer CSG Rendering with Consumer Level.. - Erhart, Tobler (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ extraction-power,
  author = "And Depth Extraction",
  title = "The power of a two-sided depth test and its application to CSG rendering",
  url = "citeseer.ist.psu.edu/570311.html" }
Citations (may not include all citations):
837   Cambridge University Press (context) - MOTWANI, RAGHAVAN - 1995
130   Models and issues in data stream systems (context) - BABCOCK, BABU et al. - 2002  ACM   DBLP
53   Fast computation of generalized Voronoi diagrams using graph.. - HOFF, KEYSER et al. - 1999  ACM   DBLP
41   Interactive multi-pass programmable shading - PEERCY, OLANO et al. - 2000  ACM   DBLP
40   A real-time procedural shading system for programmable graph.. (context) - PROUDFOOT, MARK et al. - 2001  ACM   DBLP
38   A user-programmable vertex engine (context) - LINDHOLM, KILGARD et al. - 2001  ACM   DBLP
33   Near realtime CSG rendering using tree normalization and geo.. (context) - GOLDFEATHER, MOLNAR et al. - 1989
30   Hierarchical Zbuffer visibility - GREENE, KASS et al. - 1993
19   Fast constructive-solid geometry display in the pixelpowers .. (context) - GOLDFEATHER, HULTQUIST et al. - 1986
15   Transparency and antialiasing algorithms implemented with th.. (context) - MAMMEN - 1989  ACM
12   Large deviations for quicksort (context) - MCDIARMID, HAYWARD - 1996  ACM   DBLP
10   Finding smallest polygons (context) - DOBKIN, DRYSDALE et al. - 1983
10   Interactive order-independent transparency - EVERITT - 2002
9   Correct shading of regularized CSG solids using a depth-inte.. (context) - ROSSIGNAC, WU - 1992
8   Interactive motion planning using hardwareaccelerated comput.. - HOFF, CULVER et al. - 2000
6   Fast implementation of depth contours using topological swee.. - MILLER, RAMASWAMI et al. - 2001  ACM   DBLP
5   Hardware shadow mapping - EVERITT, REGE et al. - 2002
5   buffer CSG rendering algorithm (context) - STEWART, LEACH et al. - 1998
4   buffer rendering from CSG: The trickle algorithm (context) - EPSTEIN, JANSEN et al. - 1989
3   Linear-time CSG rendering of intersected convex objects - STEWART, LEACH et al. - 2002
3   buffer CSG rendering algorithm for convex objects (context) - STEWART, LEACH et al. - 2000
1   and find (context) - HOARE - 1961
1   Fast matrix multiples using graphics hardware (context) - LARSEN, MCALLISTER - 2001
1   buffer CSG rendering with consumer level hardware (context) - ERHART, TOBLER - 2000
1   249--261 (context) - WIEGAND - 1996

Documents on the same site (http://theory.stanford.edu/~kamesh/pub.htm):   More
Web Caching using Access Statistics - Meyerson, Munagala, Plotkin (2001)   (Correct)
Extending Greedy Multicast Routing to Delay Sensitive.. - Goel, Munagala (1999)   (Correct)
Online Algorithms for Caching Multimedia Streams - Andrews, Munagala (2000)   (Correct)

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