Public Member Functions
	VERTEX (size_t aIndex, double aX, double aY, POLYGON_TRIANGULATION *aParent)

VERTEX &	operator= (const VERTEX &)=delete

VERTEX &	operator= (VERTEX &&)=delete

bool	operator== (const VERTEX &rhs) const

bool	operator!= (const VERTEX &rhs) const

VERTEX *	split (VERTEX *b)
	Split the referenced polygon between the reference point and vertex b, assuming they are in the same polygon.

void	remove ()
	Remove the node from the linked list and z-ordered linked list.

void	updateOrder ()

void	updateList ()
	After inserting or changing nodes, this function should be called to remove duplicate vertices and ensure z-ordering is correct.

void	zSort ()
	Sort all vertices in this vertex's list by their Morton code.

bool	inTriangle (const VERTEX &a, const VERTEX &b, const VERTEX &c)
	Check to see if triangle surrounds our current vertex.

double	area (const VERTEX *aEnd=nullptr) const
	Returns the signed area of the polygon connected to the current vertex, optionally ending at a specified vertex.

Public Attributes
const size_t	i

double	x

double	y

POLYGON_TRIANGULATION *	parent

VERTEX *	prev = nullptr

VERTEX *	next = nullptr

int32_t	z = 0

VERTEX *	prevZ = nullptr

VERTEX *	nextZ = nullptr

Detailed Description

Definition at line 117 of file polygon_triangulation.h.

Constructor & Destructor Documentation

◆ VERTEX()

POLYGON_TRIANGULATION::VERTEX::VERTEX	(	size_t	aIndex,
		double	aX,
		double	aY,
		POLYGON_TRIANGULATION *	aParent
	)

inline

Definition at line 119 of file polygon_triangulation.h.

Member Function Documentation

◆ area()

double POLYGON_TRIANGULATION::VERTEX::area ( const VERTEX * aEnd = nullptr ) const

inline

Returns the signed area of the polygon connected to the current vertex, optionally ending at a specified vertex.

Definition at line 282 of file polygon_triangulation.h.

References next, x, and y.

Referenced by POLYGON_TRIANGULATION::earcutList(), POLYGON_TRIANGULATION::goodSplit(), and POLYGON_TRIANGULATION::TesselatePolygon().

◆ inTriangle()

bool POLYGON_TRIANGULATION::VERTEX::inTriangle	(	const VERTEX &	a,
		const VERTEX &	b,
		const VERTEX &	c
	)

inline

Check to see if triangle surrounds our current vertex.

Definition at line 271 of file polygon_triangulation.h.

References x, and y.

Referenced by POLYGON_TRIANGULATION::isEar().

◆ operator!=()

bool POLYGON_TRIANGULATION::VERTEX::operator!= ( const VERTEX & rhs ) const

inline

Definition at line 134 of file polygon_triangulation.h.

◆ operator=() [1/2]

VERTEX & POLYGON_TRIANGULATION::VERTEX::operator= ( const VERTEX & )

delete

◆ operator=() [2/2]

VERTEX & POLYGON_TRIANGULATION::VERTEX::operator= ( VERTEX && )

delete

◆ operator==()

bool POLYGON_TRIANGULATION::VERTEX::operator== ( const VERTEX & rhs ) const

inline

Definition at line 130 of file polygon_triangulation.h.

References x, and y.

◆ remove()

void POLYGON_TRIANGULATION::VERTEX::remove ( )

inline

Remove the node from the linked list and z-ordered linked list.

Definition at line 174 of file polygon_triangulation.h.

References next, nextZ, prev, and prevZ.

Referenced by POLYGON_TRIANGULATION::createList(), POLYGON_TRIANGULATION::earcutList(), POLYGON_TRIANGULATION::removeNullTriangles(), POLYGON_TRIANGULATION::simplifyList(), and updateList().

◆ split()

VERTEX * POLYGON_TRIANGULATION::VERTEX::split ( VERTEX * b )

inline

Split the referenced polygon between the reference point and vertex b, assuming they are in the same polygon.

Notes that while we create a new vertex pointer for the linked list, we maintain the same vertex index value from the original polygon. In this way, we have two polygons that both share the same vertices.