In recent years, Geometric Data Structures from computational geometry have been widely adopted by computer graphics designers. In computational geometry, it is often necessary to process geometric objects into simple structures so that operations on the objects can be performed easily and efficiently. This is called geometric data structuring approach. This approach can be used for designing highly elegant data structures to solve a number of geometrical problems. Many solutions draw their elegance and efficiency from the mutually enriching combination of such geometrical data structures with computer graphics algorithms.

geometric data structures

An algorithm is a clear step-by-step description of how to solve a problem. We use algorithms in daily life without being aware of it. When you search for a name in the cell phone, you use an algorithm called interpolation. When you look for the shortest route to a destination, you use an algorithm. These algorithms are executed by human beings. When algorithms are very complicated, they are executed by computers.

Classic data structures

There are many types of geometric data structures. The classic structures include lists, graphs and trees. However, these classic structures have limitations. They are generally one-dimensional. Hence, they cannot capture the rich structural properties of geometric objects. They cannot represent facial ordering, and connections between sub-divisions. Geometric objects with higher dimensions and more complicated relationships cannot be represented by classical data structures. They cannot be represented by using strictly numeric data structures. They need combinations that are challenging and difficult. They can be managed only by computer graphics and algorithms.

Data structures used for storing geometric objects should ideally achieve all of the following goals:

  • Capture structural information
  • Allow for efficient query processing
  • Allow for updates
  • Optimize the space required
  • Store objects efficiently so as to minimize the number of accesses when the input size is very large

In computational geometry, many complex data structures have been designed for storing geometric objects. Many of these structures are useful in solving a number of problems in computer graphics.

Computer graphics

Computer graphics refers to products like diagrams or designs used for illustration or calculations especially for commercial purposes. Computer graphics implies drawing pictures or renderings on the computer. The pictures can be photographs, drawings, movies, or simulations, pictures of things which do not yet exist and maybe could never exist. Or they may be pictures from places we cannot see directly, such as medical images from inside your body. In computer graphics, graphics software or image editing software is a program or collection of programs that enable a designer to manipulate visual images on a computer.

Geometric data structures

An important role in computer graphics.

  • With computer graphics it is possible to produce pictures of real concrete objects and also abstract synthetic objects.
  • It is possible to produce animations and moving pictures.
  • The user can control the speed of animation, the portion that is viewed and the geometric relationships between objects.
  • The objects can be moved or tumbled with relation to the observer. The objects can be stationary or move about in geometrical dimensions. Walk-through effect can be added. Both object and viewer can be made to move.
  • With update dynamics, it is possible to change the geometric shape, color or dimensions of the objects.

Geometric data structures help to enhance the effects of computer graphics particularly related to algorithms.