edu.princeton.cs.algorithms

Class FarthestPair

java.lang.Object

edu.princeton.cs.algorithms.FarthestPair

public class FarthestPair
extends Object

Compilation: javac FarthestPair.java Execution: java FarthestPair < input.txt Dependencies: GrahamScan.java Point2D.java Given a set of N points in the plane, find the farthest pair (equivalently, compute the diameter of the set of points). Computes the convex hull of the set of points and using the rotating callipers method to find all antipodal point pairs and the farthest pair.

Constructor Summary

Constructors

Constructor and Description
FarthestPair(Point2D[] points)

Method Summary

Methods

Modifier and Type	Method and Description
double	distance()
Point2D	either()
static void	main(String[] args)
Point2D	other()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

FarthestPair

public FarthestPair(Point2D[] points)

Method Detail

either

public Point2D either()

other

public Point2D other()

distance

public double distance()

main

public static void main(String[] args)