UVOverlapOptions Struct Reference

Options for compute_uv_overlap. More...

#include <lagrange/bvh/compute_uv_overlap.h>

Public Attributes
std::string	uv_attribute_name
	UV attribute name.
bool	compute_overlap_area = true
	If true (default), compute the total overlap area via Sutherland-Hodgman clipping.
bool	compute_overlap_coloring = false
	If true, compute a per-facet integer attribute that assigns each triangle a color (greedy graph coloring of the overlap graph).
std::string	overlap_coloring_attribute_name = "@uv_overlap_color"
	Name of the per-facet output integer attribute written when compute_overlap_coloring is true.
bool	compute_overlapping_pairs = false
	If true, populate UVOverlapResult::overlapping_pairs with the sorted list of (i, j) facet-index pairs that have a positive-area interior intersection.
UVOverlapMethod	method = UVOverlapMethod::Hybrid
	Candidate pair detection algorithm.

Detailed Description

Options for compute_uv_overlap.

Member Data Documentation

uv_attribute_name

std::string uv_attribute_name

UV attribute name.

Empty string = use the first compatible UV attribute found on the mesh. Vertex, indexed, and corner attributes are all supported.

compute_overlap_area

bool compute_overlap_area = true

If true (default), compute the total overlap area via Sutherland-Hodgman clipping.

Set to false when only overlap detection or coloring is needed (faster).

compute_overlap_coloring

bool compute_overlap_coloring = false

If true, compute a per-facet integer attribute that assigns each triangle a color (greedy graph coloring of the overlap graph).

Color 0 = not overlapping with any other triangle; colors >= 1 are assigned so that no two triangles with the same color have a positive-area intersection. This allows splitting UV charts into non-overlapping layers before repacking.

---

The documentation for this struct was generated from the following file:

• lagrange/bvh/compute_uv_overlap.h