The emphasis of this course focuses on the capabilities of the WebGL application programming interface (i.e., programming library, often called an API).

Explosion of interest in 3D graphics through a browser

course Share on Application development with webGL Authors: Ed Angel University of New Mexico University of New MexicoView Profile , Dave Shreiner Unity, Technologies Unity, TechnologiesView Profile Authors Info & Claims SA '17: SIGGRAPH Asia 2017 CoursesNovember 2017 Article No.: 1Pages 1–81https://doi.org/10.1145/3134472.3134481Published:27 November 2017Publication History 0citation290DownloadsMetricsTotal Citations0Total Downloads290Last 12 Months7Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

OpenGL is the most widely available library for creating interactive computer graphics applications across all major computer operating systems. Its uses span from creating applications for scientific visualizations to computer-aided design and interactive gaming and entertainment. With each new version, its capabilities reveal the most up-to-date features of modern graphics hardware. This course provides an accelerated introduction to programming OpenGL, emphasizing the most modern methods for using the library. OpenGL has undergone numerous updates in recent years which have fundamentally changed how programmers interact with the application programming interface (API), and the skills required for being an effective OpenGL programmer. The most notable of those changes was the introduction of shader-based rendering. Introduced into the API many years ago, shader-based rendering has expanded to subsume almost all functionality in OpenGL. An attendee of the course will be introduced to each of the shader stages in OpenGL, along with methods for specifying data to be used in rendering with OpenGL. While there have been numerous courses on OpenGL in the past, the recent sequence of revisions to the API -- culminating in OpenGL version 4.1 -- have provided a wealth of new functionality and features to create ever-richer content. This course builds from demonstrating the use of the most fundamental shader-based OpenGL pipeline, to introducing all of the latest shader stages.

OpenGL is the most widely available library for creating interactive computer graphics applications across all of the major computer operating systems. Its uses range from creating applications for scientific visualizations to computer-aided design, interactive gaming and entertainment, and with each new version, its capabilities reveal the most up-to-date features of modern graphics hardware.

OpenGL is a library for doing computer graphics. By using it, you can create interactive applications that render high-quality color images composed of 3D geometric objects and images.

Abstract We present a new, single‐rate method for compressing the connectivity information of a connected 2‐manifold triangle mesh with or without boundary. Traditional compression schemes interleave geometry and connectivity coding, and are thus typically unable to utilize information from vertices (mesh regions) they have not yet processed. With the advent of competitive point cloud compression schemes, it has become feasible to develop separate connectivity encoding schemes that can exploit complete, global vertex position information to improve performance. Our scheme demonstrates the utility of this separation of vertex and connectivity coding. By traversing the mesh edges in a consistent fashion, and using global vertex information, we can predict the position of the vertex that completes the unprocessed triangle attached to a given edge. We then rank the vertices in the neighborhood of this predicted position by their Euclidean distance. The distance rank of the correct closing vertex is stored. Typically, these rank values are small, and the set of rank values thus possesses low entropy and compresses very well. The sequence of rank values is all that is required to represent the mesh connectivity—no special split or merge codes are necessary. Results indicate improvements over traditional valence‐based schemes for more regular triangulations. Highly irregular triangulations or those containing a large number of slivers are not well modelled by our current set of predictors and may yield poorer connectivity compression rates than those provided by the best valence‐based schemes.

No abstract available.