Graphics Reference
In-Depth Information
[Baciu99] Baciu, George. Wingo Wong. Hanqiu Sun. “RECODE: An Image-
based Collision Detection Algorithm,”
Journal of Visualization and Computer
Animation
, vol. 10, no. 4, pp. 181-192, 1999.
[Baraff92] Baraff, David.“Dynamic Simulation of Non-penetrating Rigid Bod-
ies,” Ph.D. thesis, Technical Report 92-1275, Computer Science Department,
Cornell University, 1992.
http://www.pixar.com/companyinfo/research/deb/
[Barber96] Barber, C. Bradford. David Dobkin. Hannu Huhdanpaa. “The
Quickhull Algorithm for Convex Hulls,”
ACM Transactions on Mathematical
Software
, vol. 22, no. 4, pp. 469-483, 1996.
http://www.acm.org/pubs/citations/journals/toms/1996-22-4/p469-barber/
[Barequet96] Barequet, Gill. Bernard Chazelle. Leonid Guibas. Joseph
Mitchell. Ayellet Tal. “BOXTREE: A Hierarchical Representation for Surfaces
in 3D,”
Computer Graphics Forum
, vol. 15, no. 3, pp. 387-396, 1996.
ftp://ftp.ams.sunysb.edu/pub/geometry/boxtree.ps.gz
[Barequet97] Barequet, Gill. Subodh Kumar.“Repairing CAD Models,”
Proceed-
ings of the 8th Conference on Visualization 1997 (VIS 97)
, pp. 363-370, October
1997.
ftp://ftp.cs.technion.ac.il/pub/barequet/papers/unv-vis97.ps.gz
[Barequet99] Barequet, Gill. Sariel Har-Peled. “Efficiently Approximating the
Minimum-volume Bounding Box of a Point Set in Three Dimensions,”
Proceed-
ings of theTenth Annual ACM-SIAMSymposium on Discrete Algorithms
, pp. 82-91,
1999.
http://valis.cs.uiuc.edu/
∼
sariel/research/papers/98/bbox.pdf
[Barrera03] Barrera, Tony. Anders Hast. Ewert Bengtsson. “A Fast and Simple
All-integer Parametric Line,”in Jeff Lander (ed.),
Graphics ProgrammingMethods
.
Charles River Media, 2003.
[Baumgart72] Baumgart, Bruce. “Winged Edge Polyhedron Representation,”
Artificial Intelligence Project Memo AIM-179 (CS-TR-72-320)
, Computer Science
Department, Stanford University, 1972.
ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/72/320/CS-TR-72-320.pdf
[Bekker01] Bekker, Henk. Jos Roerdink. “An Efficient Algorithm to Calculate
the Minkowski Sum of Convex 3D Polyhedra,”in
Computational Science - ICCS
2001
,
Lecture Notes in Computer Science 2073
, Springer-Verlag, pp. 619-628, 2001.
http://www.cs.rug.nl/
∼
roe/publications/ccs3.ps.gz
[Belov02] Belov, Gleb. “A Modified Algorithm for Convex Decomposition of
3D Polyhedra,”Technical report MATH-NM-03-2002, Institut für Numerische
Mathematik, Technische Universität, Dresden. March 2002.
http://www.math.tu-dresden.de/
∼
belov/cd3/cd3.ps
[Bentley75] Bentley, Jon.“Multidimensional Binary SearchTrees Used for Asso-
ciative Searching,”
Communications of the ACM
, vol. 18, no. 9, pp. 509-517,
