• Aucun résultat trouvé

Applications of random sampling to on-line algorithms in computational geometry

N/A
N/A
Protected

Academic year: 2021

Partager "Applications of random sampling to on-line algorithms in computational geometry"

Copied!
18
0
0

Texte intégral

Références

Documents relatifs

The Computational Geometry Algorithms Library ( CGAL ) is an open source software library that provides industrial and academic users with easy access to reliable implemen- tations

The latter conjecture asserts that every entire curve drawn on a projective variety of general type should satisfy a global algebraic equation; via a probabilistic

In this way, the theory of L 2 estimates implies the Kodaira embedding theorem : a compact complex manifold X is projective algebraic if and only if X possesses a Hermitian line

exact arithmetics Filtering Techniques (interval arithmetics, etc) exact arithmetics only when needed. Degenerate cases

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

vertex is blak; and by D ij ′ the set of rooted biolored irreduible dissetions with i blak inner verties and j white inner verties and suh that the root-vertex is blak.. A

The pendulum swung back toward learning machines in the mid-1980s with the work of the PDP Research Group 8 and the early successes of the multilayer perceptron

▫ Precise definition of convex: For any two points inside the polygon, the line segment joining them lies entirely inside the