Graphics Reference
In-Depth Information
[Wald01] Wald, Ingo. Philipp Slusallek. Carsten Benthin. Markus Wagner.
“Interactive Rendering with Coherent Ray Tracing,”
Proceedings of the
EUROGRAPHICS 2001
, pp. 153-164, 2001.
http://graphics.cs.uni-sb.de/
Publications/2001/InteractiveRenderingWithCoherentRayTracing.pdf
[Walker99] Walker, Robert. Jack Snoeyink. “Practical Point-in-Polygon Tests
Using CSG Representations of Polygons,”Technical Report TR-99-12, Depart-
ment of Computer Science, University of British Columbia, November 1999.
http://www.cs.ubc.ca/labs/imager/tr/pdf/walker.1999a.pdf
[Walster98] Walster, William.
The Extended Real Interval System
, 1998.
http://www.mscs.mu.edu/
∼
globsol/Papers/extended_intervals.ps
[Wang01] Wang, Wenping. Jiaye Wang. Myung-Soo Kim. “An Algebraic Con-
dition for the Separation of Two Ellipsoids,”
Computer Aided Geometric Design
,
vol. 18, no. 6, pp. 531-539, July 2001.
http://3map.snu.ac.kr/mskim/ftp/ellipsoid.pdf
[Wang02] Wang, Wenping. Yi-King Choi. Bin Chan. Myung-Soo Kim. Jiaye
Wang.
Efficient Collision Detection for Moving Ellipsoids Based on Simple Alge-
braic Test and Separating Planes
, Technical Report TR-2002-16, Department of
Computer Science and Information Systems, University of Hong Kong, 2002.
http://www.csis.hku.hk/research/techreps/document/TR-2002-16.pdf
[Warren93] Warren, Michael. John Salmon. “A Parallel Hashed Oct-tree
N
-body Algorithm,”
Proceedings of Supercomputing 1993
, pp. 12-21, 1993.
http://www.thesalmons.org/john/pubs/papers.html
[Weghorst84] Weghorst, Hank. Gary Hooper. Donald Greenberg. “Improved
Computational Methods for Ray Tracing,”
ACMTransactions on Graphics
, vol. 3,
no. 1, pp. 52-69, January 1984.
http://doi.acm.org/10.1145/357332.357335
[Weiler88] Weiler, Kevin. “The Radial Edge Structure: A Topological Repre-
sentation for Non-manifold Geometric Modeling,”
Geometric Modeling for CAD
Applications
, North-Holland, pp. 3-36, 1988.
[Weiler94] Weiler, Kevin. “An Incremental Angle Point in Polygon Test,” in
Paul Heckbert (ed.),
Graphics Gems IV
, Academic Press, pp. 16-23, 1994.
http://www.graphicsgems.org/
[Welzl91] Welzl, Emo. “Smallest Enclosing Disks (Balls and Ellipsoids),” in
Hermann Maurer (ed.),
New Results and New Trends in Computer Science
, vol.
555 of
Lecture Notes in Computer Science
, Springer-Verlag, pp. 359-370, 1991.
http://citeseer.ist.psu.edu/welzl91smallest.html
[Wu92] Wu, Xiaolin. “A Linear-time Simple Bounding Volume Algorithm,”
in David Kirk (ed.),
Graphics Gems III
, Academic Press, pp. 301-306, 1992.
http://www.graphicsgems.org/
