Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

danvers/GrahamScan

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Graham Scan Algorithm

This is a demo of the Graham Scan algorithm, implemented in Java and delivered with an Applet.

Usage

LinkedList<Point> list = new List();

Point p0 = new Point(x, y);
list.add(p0);
...
Point pn = new Point(x, y);
list.add(pn);

GrahamScan GS = new GrahamScan(list);
GS.Scan();

References

  • T.H. Cormen, C.E. Leiserson, R.L. Rivest & C. Stein (2001). Introduction to Algorithms. 2nd Edition, The MIT Press
  • R.L. Graham (1972). An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. Information Processing Letters 1, 132-133
  • or simply here: https://en.wikipedia.org/wiki/Graham_scan

About

A demo of the Graham Scan algorithm in Java

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

Morty Proxy This is a proxified and sanitized view of the page, visit original site.