/usr/lib/ocaml/ocamlgraph/delaunay.mli is in libocamlgraph-ocaml-dev 1.8.3-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 | (**************************************************************************)
(* *)
(* Ocamlgraph: a generic graph library for OCaml *)
(* Copyright (C) 2004-2010 *)
(* Sylvain Conchon, Jean-Christophe Filliatre and Julien Signoles *)
(* *)
(* This software is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Library General Public *)
(* License version 2.1, with the special exception on linking *)
(* described in file LICENSE. *)
(* *)
(* This software is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(**************************************************************************)
(* $Id: delaunay.mli,v 1.8 2004-02-20 14:37:40 signoles Exp $ *)
(** Delaunay triangulation. *)
(** Delaunay triangulation is available for any CCC system in the sense
of Knuth's ``Axioms and Hulls'' *)
module type CCC = sig
type point
val ccw : point -> point -> point -> bool
(** The counterclockwise relation [ccw p q r] states that the
circle through points [(p,q,r)] is traversed counterclockwise
when we encounter the points in cyclic order [p,q,r,p,...] **)
val in_circle : point -> point -> point -> point -> bool
(** The relation [in_circle p q r s] states that [s] lies
inside the circle [(p,q,r)] if [ccw p q r] is true, or outside that
circle if [ccw p q r] is false. *)
end
(** The result of triangulation is an abstract value of type [triangulation].
Then one can iterate over all edges of the triangulation. *)
module type Triangulation = sig
module S : CCC
type triangulation
val triangulate : S.point array -> triangulation
(** [triangulate a] computes the Delaunay triangulation of a set of
points, given as an array [a]. If [N] is the number of points
(that is [Array.length a]), then the running time is $O(N \log N)$
on the average and $O(N^2)$ on the worst-case. The space used is
always $O(N)$. *)
val iter : (S.point -> S.point -> unit) -> triangulation -> unit
(** [iter f t] iterates over all edges of the triangulation [t].
[f u v] is called once for each undirected edge [(u,v)]. *)
val fold : (S.point -> S.point -> 'a -> 'a) -> triangulation -> 'a -> 'a
val iter_triangles :
(S.point -> S.point -> S.point -> unit) -> triangulation -> unit
end
(** Generic Delaunay triangulation *)
module Make(S : CCC) : Triangulation with module S = S
(** Points with integer coordinates *)
module IntPoints : CCC with type point = int * int
(** Delaunay triangulation with integer coordinates *)
module Int : Triangulation with module S = IntPoints
(** Points with floating point coordinates *)
module FloatPoints : CCC with type point = float * float
(** Delaunay triangulation with floating point coordinates *)
module Float : Triangulation with module S = FloatPoints
|