MathgeomGLS

1
(*
2
  The application for Voronoi  Shamos algorithm
3

4
  The algorithm according to Shamos-Hoey and Lee that creates the voronoi diagram
5
  of a 2D point field in N log(N). Copyright (C) 2002 Christian Huettig
6
  Restrictions: The line-cut algorithm isn't perfect (5% failure, but indicated!)
7
  Huge problems with collinearity, inefficient line discard algorithm
8
  How to use: Just throw the main unit and all whats related to out.
9
  First published: www.torry.net
10
*)
11

12
program Vor2dPick;
13

14
uses
15
  Forms,
16
  fVor2dPick in 'fVor2dPick.pas' {FormVor2dPick},
17
  Vor.GraphObjects in 'Vor.GraphObjects.pas',
18
  Vor.Shamos in 'Vor.Shamos.pas';
19

20
{$R *.res}
21

22
begin
23
  Application.Initialize;
24
  Application.CreateForm(TFormVor2dPick, FormVor2dPick);
25
  Application.Run;
26
end.
27