Skip to content

Latest commit

 

History

History
24 lines (19 loc) · 866 Bytes

File metadata and controls

24 lines (19 loc) · 866 Bytes

Delaunay-Triangulation

This code is a java implementation of Bowyer-Watson algorithm to compute Delaunary triangulation. Result is visualized through Java Graphic2D

Features:

Bowyer-Watson Algorithm Kruskal Algorithm alt tag alt tag

How to use:

Please see example in src/delaunary/Tester

About Bowyer-Watson Algorithm:

WIKI here
Tutorial here

About Kruskal Algorithm:

WIKI here Tutorial here