mirror of
https://github.com/GoldenCheetah/GoldenCheetah.git
synced 2026-04-15 05:32:21 +00:00
d56d52c01f
.. from C to a C++ class. Moved the original code to a sundirectory for reference and moved all the global variables and methods into a new class called Voronoi. .. the code still needs more work but wanted to remove the global variables as there were lots and a big risk they interact with other parts of the codebase and libraries.
31 lines
1.0 KiB
Plaintext
31 lines
1.0 KiB
Plaintext
voronoi - compute Voronoi diagram or Delaunay triangulation
|
|
SYNOPSIS
|
|
voronoi [-s -t] <pointfile >outputfile
|
|
|
|
Voronoi reads the standard input for a set of points in the plane and writes either
|
|
the Voronoi diagram or the Delaunay triangulation to the standard output.
|
|
Each input line should consist of two real numbers, separated by white space.
|
|
|
|
If option
|
|
-t
|
|
is present, the Delaunay triangulation is produced.
|
|
Each output line is a triple
|
|
i j k
|
|
which are the indices of the three points in a Delaunay triangle. Points are
|
|
numbered starting at 0. If this option is not present, the
|
|
Voronoi diagram is produced. There are four output record types.
|
|
s a b
|
|
indicates that an input point at coordinates
|
|
l a b c
|
|
indicates a line with equation ax + by = c.
|
|
v a b
|
|
indicates a vertex at a b.
|
|
e l v1 v2
|
|
indicates a Voronoi segment which is a subsegment of line number l;
|
|
with endpoints numbered v1 and v2. If v1 or v2 is -1, the line
|
|
extends to infinity.
|
|
|
|
AUTHOR
|
|
Steve J. Fortune (1987) A Sweepline Algorithm for Voronoi Diagrams,
|
|
Algorithmica 2, 153-174.
|