Topic: Computer graphics

You are looking at all articles with the topic "Computer graphics". We found 2 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

Pixel Art Scaling Algorithms

Computer graphics

Pixel-art scaling algorithms are graphical filters that are often used in video game console emulators to enhance hand-drawn 2D pixel art graphics. The re-scaling of pixel art is a specialist sub-field of image rescaling.

As pixel-art graphics are usually in very low resolutions, they rely on careful placing of individual pixels, often with a limited palette of colors. This results in graphics that rely on a high amount of stylized visual cues to define complex shapes with very little resolution, down to individual pixels. This makes image scaling of pixel art a particularly difficult problem.

A number of specialized algorithms have been developed to handle pixel-art graphics, as the traditional scaling algorithms do not take such perceptual cues into account.

Since a typical application of this technology is improving the appearance of fourth-generation and earlier video games on arcade and console emulators, many are designed to run in real time for sufficiently small input images at 60 frames per second. This places constraints on the type of programming techniques that can be used for this sort of real-time processing. Many work only on specific scale factors: 2× is the most common, with 3×, 4×, 5× and 6× also present.

Discussed on

Stanford Bunny

Computing Computer graphics

The Stanford bunny is a computer graphics 3D test model developed by Greg Turk and Marc Levoy in 1994 at Stanford University. The model consists of 69,451 triangles, with the data determined by 3D scanning a ceramic figurine of a rabbit. This figurine and others were scanned to test methods of range scanning physical objects.

The data can be used to test various graphics algorithms, including polygonal simplification, compression, and surface smoothing. There are a few complications with this dataset that can occur in any 3D scan data: the model is manifold connected and has holes in the data, some due to scanning limits and some due to the object being hollow. These complications provide a more realistic input for any algorithm that is benchmarked with the Stanford bunny, though by today's standards, in terms of geometric complexity and triangle count, it is considered a simple model.

The model was originally available in .ply (polygons) file format with 4 different resolutions.

Discussed on