Skip to main content
Conference ProceedingsOPEN ACCESS

A parallel algorithm for 3D geometry transformations in OpenGL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1685 LNCS 659-662
DOI: 10.1007/3-540-48311-x_92
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We have designed an algorithm which allows the OpenGL geometry transformations to be processed on a multiprocessor system. We have integrated it in Mesa, a 3D graphics library with an API which is very similar to that of OpenGL. We get speedup up to 1.8 for biprocessor without any modification of the application using the library. In this paper we study the issues of our algorithm and how we solve them. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Sébot Julien, J., Vartanian, A., Béchennec, J. L., & Drach-Temam, N. (1999). A parallel algorithm for 3D geometry transformations in OpenGL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 659–662). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_92

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free