Tech News
← Home  ·  All topics

Computer Graphics

4 GoKawiil briefs on this topic · RSS for computer graphics

Open-source tutorial explains how to build a basic 3D modeller in 500 lines

Software developer Erick Dransch has written a '500 Lines or Less' chapter walking through the construction of a simple CAD-style 3D modelling tool. The guide covers the three essential components any CAD software needs: a data structure to represent 3D objects, a method to render those objects on a 2D screen, and tools for users to interact with and edit the design.

University of Utah launches official interactive page for the Utah Teapot model

A new official site lets users visualize and download multiple historical versions of the Utah Teapot, the Bézier-patch model created by Martin Newell in 1975 and later modified by Jim Blinn, Frank Crow and others. The page also offers customization options for mesh type, resolution, orientation and texture layout, along with a free-use license that asks users to credit the model's origin at the University of Utah.

History of CG traced from 1950s research labs to today's studios

A retrospective overview recounts how computer graphics originated in the 1950s as a visualization tool at government and corporate research centers such as Bell Labs and Boeing. It traces the field's development through university programs at Ohio State, MIT, Utah, Cornell and others, into Xerox PARC in the 1970s, and eventually into broadcast video and feature films by the early 1980s, noting Industrial Light and Magic's ongoing role in advancing the technology. It also highlights an earlier precursor: MIT professors Parry Moon and Domina Eberle Spencer manually constructing a radiosity-style lighting image from paper samples in the 1940s, based on mathematical illumination models.

Bridson's 2007 one-page paper still powers modern Poisson disk sampling algorithms

The piece revisits Robert Bridson's 2007 single-page paper, which offers a fast algorithm for placing random points—like trees in a procedurally generated forest—so no two fall closer than a set minimum distance. It contrasts this compact, widely-cited solution with a nearly 1,000-page 2024 proof of the geometric Langlands conjecture, highlighting the range of scales in mathematical work. The algorithm uses a grid and an active-point list to sample points efficiently in an annulus around existing points, avoiding the slowdown of naive rejection sampling.