G9: Polygon Meshes Flashcards

1
Q

What is explicitly defined as a surface in polygon meshes?

A

A list of polygon vertex coordinates and the connections between vertices to form polygons.

Most commonly, triangle meshes are used.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why are triangle meshes popular?

A

They are analogous to raster images in 2D and represent arbitrary surfaces with a set of polygon elements.

They offer a simple data structure composed of flexible base elements, making algorithms simpler and faster.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is ‘triangle soup’ in the context of encoding triangle meshes?

A

A method that stores three vertices per triangle, similar to a point cloud, but with triangles implied by each vertex triplet.

It is simple to implement but wasteful as it stores shared vertices multiple times.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the advantages of using a ‘vertex list’ and ‘face list’ for encoding triangle meshes?

A

It defines all vertex coordinates in a list and uses indices to reference these vertices for each triangle, eliminating duplicated vertex coordinates.

However, it remains hard to find triangles sharing vertices and edges.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the difference between topology and geometry in the context of meshes?

A

Topology refers to the global structure and does not care about actual coordinates, while geometry cares about local structure in addition to global structure.

Leveraging topology connections can make mesh operations easier.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the half-edge data structure?

A

A structure that uses a pair of ‘half-edges’ on each side of a shared edge to store information about adjacent faces, vertices, and edges.

It is also known as a ‘doubly connected edge list’ and uses pointers like a linked list.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How do traversal examples using half-edges work?

A

Traversal is facilitated by next and prev pointers, which make it easy to navigate the mesh and pull out elements using origin, edge, or left pointers.

This structure allows for efficient traversal of the mesh.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How can additional information like colors and surface normals be encoded at vertices?

A

Attributes for each vertex can be stored in a list, using the same indirection as face list indices.

This is useful for rendering in a rasterization pipeline, such as during shading computations.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Fill in the blank: Topology cares about _______ structure, while geometry cares about _______ structure.

A

global; local

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

True or False: The half-edge data structure is more efficient than the ‘triangle soup’ method.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly