Eda Özge özler

Den!z Özcan
Umut Şah"n
CMPE 360
Berkay Babay!ğ!t Hands-On Activity 9
Name(s):

1. Answer the following questions in 1-2 sentences:

a) What are the three possible uses of the Scene Graph in Computer Graphics?
A Scene Graph in computer graphics is primarily used for efficient rendering by organizing objects hierarchically, enabling transformations like scaling or rotation to be applied globally

b) What is the benefit of using a hierarchical structure in a Scene Graph? Give at

least two benefits. A Scene Graph in computer graphics is primarily used for efficient rendering by organizing
objects hierarchically, enabling transformations like scaling or rotation to be applied
globally
c) What are the key components typically found in a node of a scene graph?
A node in a scene graph typically contains transformation data, geometry information, parent-child relationships, rendering properties,
and additional metadata crucial for organizing and rendering complex scenes in computer graphics.
2. Your task is to evaluate the appropriateness of "Indexed Triangle Set" and "Half-
Edge Mesh" representations for triangle meshes -
across various applications,
-
determining the most suitable representation for each specific use case mentioned
in the questions below. Check the most suitable representation for each question,
and provide a concise one-sentence explanation of your response.

a) Mesh Editing and Modification (e.g. 3D modeling software)

(__) Indexed Triangle Set ~

(__) Half-Edge Mesh

Explain: !t !s cas!er to ed!t mesh !n Half-Edge Mesh .

Also
used !n Blender
.
b) Efficient Rendering for Real-Time Graphics Pipelines
~
(__) Indexed Triangle Set (__) Half-Edge Mesh
Set, s!nce we store the !ndexes of tr!angle
Explain: !ndexed Tr!angle
po!nts !n another array , !t !s more eff!c!ent.
c) Geometry Compression: In applications where bandwidth and memory usage
are critical, such as in web graphics and virtual reality, indexed triangles are

~
employed to compress geometry data by reusing vertices.

(__) Indexed Triangle Set (__) Half-Edge Mesh

set
Explain: As ment!oned !n second quest!on !ndexed tr!angle ,

are more eff!c!ent and faster

.
d) Boundary Detection:: In applications where the goal is efficient
identification and analysis of the mesh boundaries (i.e. outer edges of the
mesh).

(__) Indexed Triangle Set

~
(__) Half-Edge Mesh
to store all connect!ons
Explain: S!nce we only use one array
between vert!ces !t !s eas!er to defect boundr!es
,
us!ng
Half-Edge mesh .
3. What is the memory difference for a simple tetrahedron stored as four independent
triangles and one stored in an indexed triangle data structure? Assume that vertex
positions and normal vectors are stored for each vertex.

Storing a tetrahedron as four independent triangles requires redundant storage of vertex positions
and normal vectors for each vertex, resulting in more memory usage compared to storing it in an
indexed triangle data structure, which optimizes memory by referencing shared vertices and
normals, thus reducing redundancy and conserving memory