GPG 5권 1부 참고자료

1.1 편집기를 위한 문맥 감지 HUD

• [Eclipse04] Eclipse. 웹 주소 http://eclipse.org. 2004.
• [Martin04] Martin, Adam 외. Java Games Factory, “Libraries and Code Snippets.” http://grexengine.com/people/adam/gpg5/ 및 http://grexengine.com/sections/externalgames/.
• [Popa99] Popa, Adrian. “Re: How Does a Head-Up Display (HUD) Work on the Aircraft?”, 웹 주소 http://www.madsci.org/posts/archives/jul99/931328936.Eg.r.html.

1.2 게임 안에서 텍스트 자료 파싱하기

• [Aho, Sethi, Ullman85] Compilers: Principles, Techniques and Tools.
• [CS310] http://marvin.ibest.uidaho.edu/~heckendo/CS310/grammar.html.
• [Eli] http://eli-project.sourceforge.net/elionline4.4/lex_toc.html.
• [Estier] http://cui.unige.ch/db-research/Enseignement/analyseinfo/AboutBNF.html.
• [Garshol03] http://www.garshol.priv.no/download/text/bnf.html.
• [Lex&Yacc] http://dinosaur.compilertools.net/.
• [Punctuation] http://www.wordiq.com/definition/Space_(punctuation).
• [RecursiveDescent] http://encyclopedia.thefreedictionary.com/Recursive%20descent%20parser.

1.4 템플릿을 이용한 C++ 반영 기능 구현

• [BIL00] Bilas, Scott. “A Generic Function-Binding Interface.” Game Programming Gems, 56-67. Charles River Media. 번역서는 “일반화된 함수-바인딩 인터페이스,” Game Programming Gems, 정보문화사, 2000.
• [CAF01] Cafrelli, Charles. “A Property Class for Generic C++ Member Access.” Game Programming Gems 2, 46-50. Charles River Media. 번역서는 “범용 C++ 멤버 접근을 위한 속성 클래스,” Game Programming Gems 2, 정보문화사, 2002.
• [JEN01] Jensen, Lasse Staff. “A Generic Tweaker.” Game Programming Gems 2, 118-126. Charles River Media. 번역서는 “범용 트위커,” Game Programming Gems 2, 정보문화사, 2002.
• [OLS00] Olsen, John. “Stats: Real-Time Statistics and In-Game Debugging.” Game Programming Gems, 115-119. Charles River Media. 번역서는 “Stats: 실시간 통계와 게임 내 디버깅,” Game Programming Gems, 정보문화사, 2000.
• [POU02] Pouratian, Allen. “Platform-Independent, Function-Binding Code Generator.” Game Programming Gems 3, 38-42. Charles River Media. 번역서는 “플랫폼 독립적인 함수 바인딩 코드 생성기,” Game Programming Gems 3, 정보문화사, 2003.
• [STR97] Stroustrup, Bjarne. “Templates.” The C++ Programming Language, Third Edition, 327-354. Addison Wesley, 2000.
• [WAK01] Wakeling, Scott. “Dynamic Type Information.” Game Programming Gems 2, 38-45. Charles River Media. 번역서는 “동적인 형 정보,” Game Programming Gems 2, 정보문화사, 2002.

1.5 빠른 BSP를 위한 구 트리

• [FAQ99] “BSP Tree FAQ.” 웹 주소 http://www.gamedev.net/reference/articles/article657.asp. August 22, 1999.
• [Ranta03] “BSP Trees: Theory and Implementation.” 웹 주소 http://www.devmaster.net/articles/bsp-trees/. November 9, 2003.
• [RatCliff01] RatCliff, John W. “Sphere Trees for Fast Visibility Culling, Ray Tracing, and Range Searching.” Game Programming Gems 2, 384-387. Charles River Media. 번역서는 “빠른 가시성 제외, 레이 트레이싱, 범위 검색을 위한 구 트리,” Game Programming Gems 2, 정보문화사, 2002.

1.6 개선된 절두체 선별

• [Jelinek&Sykora01] Jelinek, Josef 및 Daniel Sykora. “Efficient Frustum Culling.” 웹 주소 http://www.cg.tuwien.ac.at/studentwork/CESCG/CESCG-2002/DSykoraJJelinek/.
• [Morley00] Morley, Mark. “Frustum Culling in OpenGL.” 웹 주소 http://www.markmorley.com/opengl/frustumculling.html. December, 2000.
• [Puig04] Puig, Frank. “A Fast Frustum Class.” 웹 주소 http://fpuig.cjb.net/.

1.7 일반적 페이저

• [Alexandrescu01] Alexandrescu, Andrei. Modern C++ Design. Addison Wesley, 2001. 번역서는 제네릭 프로그래밍과 디자인 패턴을 적용한 Modern C++ Design, 인포북, 2003.
• [Lakos96] Lakos, John, Large-Scale C++ Software Design, Addison Wesley, 1996.
• [Meyers96] Meyers, Scott, More Effective C++, Addison Wesley, 1996. 번역서는 More Effective C++, 인포북, 2003.

1.8 대규모 스택 기반 상태기계

• [Gamma94] Gamma 외. Design Patterns: Elements of Reusable Object-Oriented Software, 305-313. Addison Wesley Longman, Inc, 1994.
• [Meyers98] Meyers, Scott, Effective C++, Second Edition, 176-177, Addison Wesley Longman, Inc., 1998.

1.9 BSP 트리를 이용한 CSG 구축

• [Franz Rottensteiner] Franz Rottensteiner, Franz, “Constructive Solid Geometry.” 웹 주소 http://www.ipf.tuwien.ac.at/fr/buildings/diss/node38.html.

1.10 루아를 게임에 통합

• [Ierusalimschy03] Roberto Ierusalimschy, Programming in Lua, Published by Lua.org, December 2003.

1.11 방침 기반 설계로 자유 목록 개선하기

• [Alexandrescu01] Alexandrescu, Andrei. Modern C++ Design. Addison Wesley, 2001. 번역서는 제네릭 프로그래밍과 디자인 패턴을 적용한 Modern C++ Design, 인포북, 2003.
• [GoF95] Gamma, Erich 외. Design Patterns. Addison Wesley, 1995.
• [Glinker04] Glinker, Paul, “Fight Memory Fragmentation with Templated Freelists,” Game Programming Gems 4, Charles River Media, 2004. 번역서는 “자유목록 템플릿을 이용한 메모리 단편화 해결,” Game Programming Gems 4, 정보문화사, 2005
• [STLPort04] STLPort 웹 페이지. www.stlport.org. September 20, 2004.
• [Vandevoorde03] Vandevoorde, David, 및 Nicolai M. Josuttis, C++ Templates: The Complete Guide, Addison Wesley, 2003.

1.12 실시간 원격 디버그 메시지 기록기

• [Gizz04] 필자의 웹 사이트 http://www.gizz-moo.com.

1.13 투명한 클래스 저장 및 로딩 요령

• [Bilas00] Bilas, Scott, “An Automatic Singleton Utility,” Game Programming Gems, Charles River Media, Inc., 2000. 번역서는 “자동적인 단일체 유틸리티,” Game Programming Gems, 정보문화사, 2000.
• [Boer00] Boer, James, “Resource and Memory Management,” Game Programming Gems, Charles River Media, Inc., 2000. 번역서는 “자원과 메모리 관리,” Game Programming Gems, 정보문화사, 2000.
• [Brownlow02] Brownlow, Martin, “Save Me Now!,” Game Programming Gems 3, Charles River Media, Inc., 2002. 번역서는 “자동화된 게임 저장 구현,” Game Programming Gems 3, 정보문화사, 2003.
• [Olsen00] Olsen, John, “Fast Data Load Trick,” Game Programming Gems, Charles River Media, Inc., 2000. 번역서는 “빠른 데이터 로드 기법,” Game Programming Gems, 정보문화사, 2000.
• [Wakelin01] Wakeling, Scott, “Dynamic Type Information,” Game Programming Gems 2, Charles River Media, Inc., 2001. 번역서는 “동적인 형 정보,” Game Programming Gems 2, 정보문화사, 2002.

1.14 효과적인 캐시 무관 ABT 트리 구현

• [Agarwal03] Agarwal, Arge, and Bryan Danner, Bryan, “Cache-Oblivious Data Structures for Orthogonal Ranger Searching”, ACM Proceedings of the 19th Annunal Symposium on Conecptual Geometry, 2003.
• [Bar-Zeev03] Bar-Zeev, “Scenegraphs: Past, Present and Future.” 웹 주소 http://www.realityprime.com/scenegraph.php. 2003.
• [Bender00] Bender, Demaine 및 Farach-Colton, “Cache-oblivious B-trees”, Proc. 41st Ann. Symp. on Foundations of Computer Science, pp.399-409, IEEE Computer Society Press, 2000.
• [Brodal03] Brodal, “Cache Oblivious Searching and Sorting.” Seminar, IT University of Copenhagen. Copenhagen, Denmark. 2003.
• [Ding04] Ding, C. “Data Layout Optimizations, Computer Organization.” Lecture, Rochester, 2004.
• [Ericson03] Ericson, Christer. “Memory Optimization.” CDC 2003, Santa Monica, Sony Computer Entertainment, 2003.
• [Frigo99] Frigo, Leiserson 및 Prokop, Ramachandran, “Cache-Oblivious Algorithms.” Proc. 40th Annual Symposium on Foundations of Computer Science (FOCS), 285-297, 1999.
• [Gomez01] Gomez, Loura, Compressed Axis-Aligned Bounding Box Trees, Game Programming Gems 2, Charles River Media, 2001. 번역서는 “압축된 축 정렬 경계상자 트리,” Game Programming Gems 2, 정보문화사, 2002.
• [Hennessy03] Hennessy, Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann Publishers Inc., 2003.
• [Hill02] Hill, Lipasti, Cache Performance, University of Wisconsin-Madison, 2002.
• [Moore65] Moore, “Cramming more components onto integrated circuits.” Electronic Magazine 38, 114-117, 1965.
• [PAPI04] PAPI, “Performance application programming interface.” 웹 주소 http://icl.cs.utk.edu/projects/papi. 2004.
• [Patterson97] Patterson, Hennessy, Computer Organization and Design Second Edition: The Hardware/Software Interface. Morgan Kaufmann, 1997.
• [Sedgewick90] Sedgewick, Algorithms in C. Addison Wesley, 1990.
• [Smith87] Smith, “Line (block) size choice for CPU cache memories.” IEEE Transactions on Computers, 1987.
• [Szecsi03] Szecsi, “An effective Implementation of the K-D Tree.” Graphics Programming Methods, Charles River Media, 2003.
• [van Emde Boas77] van Emde Boas, “Preserving order in a forest in less than logarithmic time and linear space,” Inf. Process. Lett., 6:80-82, 1977.
• [VTune04] VTune, Intel Corp, 2004.
• [Wloka03] Wloka. “Batch, Batch, Batch: What Does It Really Mean?” GDC, 2003.

1.15 상태기계의 시각적인 설계

• [Bignami04] Bignami, Luigi, UMLPad, 웹 주소 http://web.tiscali.it/ggbhome/umlpad/umlpad.htm.
• [Burns04] Burns, Jon and David Eichorn. “GDC 2004―Lua in the Gaming Industry Roundtable Report.” 웹 주소 http://lua-users.org/lists/lua-l/2004-04/msg00164.html.
• [Herrington03] Herrington, Jack. Code Generation in Action. Manning Publications, 2003.
• [Ierusalimschy03-1] Ierusalimschy, Roberto., L. H. de Figueiredo, W. Celes. “Lua 5.0 Reference Manual.” Technical Report MCC-14/03, PUC-Rio, 2003. 웹 주소 http://www.lua.org/manual/5.0/.
• [Ierusalimschy03-2] Ierusalimschy, Roberto. Programming in Lua. Lua.org, 2003. 웹 주소 http://www.inf.puc-rio.br/~roberto/book/.
• [Lua04] Lua. 웹 주소 http://www.lua.org/.
• [Manzur04] Manzur, Ariel. tolua++. 웹 주소 http://www.codenix.com/~tolua/.

1.16 일반적 구성요소 라이브러리

• [Gamma95] Gamma, Erich, Richard Helm, Ralph Johnson, John Vlissides. Design Patterns. Addison-Wesley Professional, 1995.

1.17 선택의 문제 - 메뉴 시스템 하나

• [Gamma95] Gamma, Erich 외. Design Patterns. Addison-Wesley, 1995.