package lutin

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Legend:
Library
Module
Module type
Parameter
Class
Class type

Drawing into convex Polyhedron.

This module implements algorithms to draw uniformally in a convex polyhedron given a set of generators.

type point = float list

val draw_point_cheap : point list -> point

This one is cheaper, but a little bit unfair (i.e., not uniform).

val draw_n_distinct_points : int -> point list -> point list

Draws n dictinct points among a list of points l, or |l| if |l|<n (typically, vertices).

val draw_n_points : int -> point list -> point list

Draws n points among a list of points (any point may be drawn several times).

type poly_wrap

Parallelogram envelopping a convex Polyhedron defined by a set of generators.

val compute_poly_wrap : point list -> poly_wrap

val one_point_poly_wrap : poly_wrap -> point

Draw one point in a poly_wrap.

BEWARE: the point returned by one_point_poly_wrap is not necessary a solution!

val n_points_poly_wrap : poly_wrap -> int -> point list

Draw n points in a poly_wrap.