# Browsing French translation

Before translating, be sure to go through Ubuntu Translators instructions and French guidelines.
 17601 → 17610 of 41578 results First • Previous • Next • Last
38345.
Math::ConvexHull::MonotoneChain optionally exports a single function convex_hull which calculates the convex hull of the input points and returns it. Andrew's monotone chain convex hull algorithm constructs the convex hull of a set of 2-dimensional points in O(n*log(n)) time.
```Description
```
(no translation yet)
Located in Package: libmath-convexhull-monotonechain-perl
38346.
It does so by first sorting the points lexicographically (first by x-coordinate, and in case of a tie, by y-coordinate), and then constructing upper and lower hulls of the points in O(n) time. It should be somewhat faster than a plain Graham's scan (also O(n*log(n))) in practice since it avoids polar coordinates.
```Description
```
(no translation yet)
Located in Package: libmath-convexhull-monotonechain-perl
38347.
Perl module to calculate convex hulls using Graham's scan (n*log(n))
```Summary
```
(no translation yet)
Located in Package: libmath-convexhull-perl
38348.
Math::ConvexHull is a simple module that calculates convex hulls from a set of points in 2D space. It is a straightforward implementation of the algorithm known as Graham's scan which, with complexity of O(n*log(n)), is the fastest known method of finding the convex hull of an arbitrary set of points. There are some methods of eliminating points that cannot be part of the convex hull. These may or may not be implemented in a future version.
```Description
```
(no translation yet)
Located in Package: libmath-convexhull-perl
38349.
The implementation cannot deal with duplicate points. Therefore, points which are very, very close (think floating point close) to the previous point are dropped since version 1.02 of the module. However, if you pass in randomly ordered data which contains duplicate points, this safety measure might not help you. In that case, you will have to remove duplicates yourself.
```Description
```
(no translation yet)
Located in Package: libmath-convexhull-perl
38350.
Perl package for numeric 1st and 2nd order differentiation
```Summary
```
(no translation yet)
Located in Package: libmath-derivative-perl
38351.
Math::Derivative exports functions for performing numerical first and second order differentiation on data. The functions take references to two arrays containing the x and y ordinates of the data and return an array of the 1st or 2nd derivative at the given x ordinates. The 2nd derivative may optionally be given values to use for the first derivative at the start and end points of the data - otherwise 'natural' values are used.
```Description
```
(no translation yet)
Located in Package: libmath-derivative-perl
38354.
Perl module to compute Voronoi diagrams from sets of points
```Summary
```
(no translation yet)
Located in Package: libmath-geometry-voronoi-perl
38355.
Math::Geometry::Voronoi computes Voronoi diagrams from a set of input points. This module is a wrapper around a C implementation by Steve Fortune, the inventor of the algorithm used (Fortune's algorithm), that was further modified by Derek Bradley.
```Description
```
(no translation yet)
Located in Package: libmath-geometry-voronoi-perl
38356.
Info on Voronoi diagrams can be found here:
```Description
```
(no translation yet)
Located in Package: libmath-geometry-voronoi-perl
 17601 → 17610 of 41578 results First • Previous • Next • Last

This translation is managed by Ubuntu French Translators, assigned by Ubuntu Translators.