-# Computing Delaunay triangulations and stuff.
+# These are the beginnings of a package to compute 2-dimensional Delaunay
+# triangulations via the incremental flip algorithm.
 #
 # _Copyright (c) 2011 Olaf Delgado-Friedrichs_
 

# ->` construct.

triangulation = do ->
  # The helper function `seq` creates a sequence from its argument
  # list.
  seq = (args...) -> new Sequence args

  # We use a hidden class to encapsulate the implementation details.
  class Triangulation



# ----

# The helper function `seq` creates a sequence from its argument
# list.
seq = (args...) -> new Sequence args


# ----

# The function `triangulation` creates an _oriented_ abstract triangulation,
# i.e. one in which the vertices of each triangle are assigned one out of two
# possible circular orders. Whenever two triangles share an edge, we moreover
# require the orientations of these to 'match' in such a way that the induced
