Aleph::ClosestPairDivideAndConquer::Result Struct Reference

#include <geom_algorithms.H>

Collaboration diagram for Aleph::ClosestPairDivideAndConquer::Result:

Public Attributes
Point	first
Point	second
Geom_Number	distance_squared

Detailed Description

Definition at line 838 of file geom_algorithms.H.

Member Data Documentation

distance_squared

Geom_Number Aleph::ClosestPairDivideAndConquer::Result::distance_squared

Definition at line 842 of file geom_algorithms.H.

Referenced by Aleph::ClosestPairDivideAndConquer::brute_force(), and Aleph::ClosestPairDivideAndConquer::recurse().

first

Point Aleph::ClosestPairDivideAndConquer::Result::first

Definition at line 840 of file geom_algorithms.H.

Referenced by Aleph::ClosestPairDivideAndConquer::closest_segment(), and Aleph::put_closest_pair_result().

second

Point Aleph::ClosestPairDivideAndConquer::Result::second

Definition at line 841 of file geom_algorithms.H.

Referenced by Aleph::put_closest_pair_result().

---

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

• geom_algorithms.H