Concept

Bùi Tường Phong

Bui Tuong Phong (December 14, 1942 – July 1975) was a Vietnamese-born computer graphics researcher and pioneer. He invented the widely used Phong shading algorithm and Phong reflection model. Phong was born in Hanoi, then French Indochina. After attending the Lycée Albert Sarraut there, he moved with his family to Saigon in 1954, where he attended the Lycée Jean Jacques Rousseau. He went to France in 1964 and was admitted to the Grenoble Institute of Technology. He received his Licence ès Sciences from Grenoble in 1966 and his Diplôme d'Ingénieur from the ENSEEIHT, Toulouse, in 1968. In 1968, he joined the Institut de Recherche en Informatique et en Automatique (then IRIA) as a researcher in Computer Science, working in the development of operating systems for digital computers. He went to the University of Utah College of Engineering in September 1971 as a research assistant in Computer Science and he received his Ph.D. from the University of Utah in 1973. Phong knew that he was terminally ill with leukemia while he was a student. In 1975, after his tenure at the University of Utah, Phong joined Stanford University as a professor. Phong was married to Bùi Thị Ngọc Bích from Nha Trang, Vietnam, in 1969 in Paris, France. He and his wife had one daughter. According to Professor Ivan Sutherland and Phong's friends, Phong was intelligent, affable and modest. About improving the quality of synthesized images he wrote, "We do not expect to be able to display the object exactly as it would appear in reality, with texture, overcast shadows, etc. We hope only to display an image that approximates the real object closely enough to provide a certain degree of realism." Two years after receiving his Ph.D., Phong died in 1975 of end-stage leukemia. Phong was the inventor of the Phong reflection model and the Phong shading interpolation method, techniques widely used in computer graphics. He published the description of the algorithms in his 1973 PhD dissertation and a 1975 paper. He developed the first algorithm for simulating specular phenomena.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.