Aleph::ConvexPolygonDistanceGJK::Result Struct Reference

Holds the results of the distance computation. More...

#include <geom_algorithms.H>

Collaboration diagram for Aleph::ConvexPolygonDistanceGJK::Result:

Public Attributes
Geom_Number	distance_squared = 0
	The minimum squared distance.
Geom_Number	distance = 0
	The minimum Euclidean distance.
Point	closest_on_first
	Witness point on the first polygon.
Point	closest_on_second
	Witness point on the second polygon.
bool	intersects = false
	True if the polygons overlap.
size_t	gjk_iterations = 0
	Count of iterations performed.

Detailed Description

Holds the results of the distance computation.

Definition at line 7557 of file geom_algorithms.H.

Member Data Documentation

closest_on_first

Point Aleph::ConvexPolygonDistanceGJK::Result::closest_on_first

Witness point on the first polygon.

Definition at line 7561 of file geom_algorithms.H.

closest_on_second

Point Aleph::ConvexPolygonDistanceGJK::Result::closest_on_second

Witness point on the second polygon.

Definition at line 7562 of file geom_algorithms.H.

distance

Geom_Number Aleph::ConvexPolygonDistanceGJK::Result::distance = 0

The minimum Euclidean distance.

Definition at line 7560 of file geom_algorithms.H.

distance_squared

Geom_Number Aleph::ConvexPolygonDistanceGJK::Result::distance_squared = 0

The minimum squared distance.

Definition at line 7559 of file geom_algorithms.H.

Referenced by Aleph::ConvexPolygonDistanceGJK::operator()().

gjk_iterations

size_t Aleph::ConvexPolygonDistanceGJK::Result::gjk_iterations = 0

Count of iterations performed.

Definition at line 7564 of file geom_algorithms.H.

intersects

bool Aleph::ConvexPolygonDistanceGJK::Result::intersects = false

True if the polygons overlap.

Definition at line 7563 of file geom_algorithms.H.

Referenced by Aleph::ConvexPolygonDistanceGJK::exact_refine_disjoint().

---

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

• geom_algorithms.H