Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Algorithmes --- Géometrie --- Informatique --- Géometrie --- Géodésie --- Topographie --- Geodesy --- Topographical surveying --- Triangulation --- Computer science

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Les représentations numériques 3D ont révolutionné notre compréhension du monde. Elles sont devenues indispensables pour simuler des opérations chirurgicales, créer de nouveaux modes d’expression artistique ou explorer les ressources naturelles. La géométrie algorithmique apparaît à l’intersection de la géométrie et de l’informatique. Comment échantillonner, représenter et traiter des formes géométriques complexes ? Comment offrir des garanties théoriques sur la qualité des approximations et la complexité des algorithmes ? Comment assurer la fiabilité et l’efficacité des programmes informatiques ? Ces questions se posent en dimensions 2 et 3, mais aussi en plus grandes dimensions, pour analyser par exemple les grandes masses de données essentielles à la science moderne.

Multidisciplinary --- informatique --- Informatique et sciences numériques --- sciences numériques --- géométrie des données --- géométrie algorithmique --- données massives --- algorithmes

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Artificial intelligence. Robotics. Simulation. Graphics --- 681.3*F22 --- 681.3*I12 --- 681.3*I29 --- 681.3*I3 --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Robotics: manipulators; propelling mechanisms; sensors (Artificial intelli- gence) --- Computer graphics (Computing methodologies) --- 681.3*I3 Computer graphics (Computing methodologies) --- 681.3*I29 Robotics: manipulators; propelling mechanisms; sensors (Artificial intelli- gence) --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Artificial intelligence. --- Computer graphics. --- Computer software. --- Geometry, algebraic. --- Robotics and Automation. --- Artificial Intelligence. --- Computer Graphics. --- Algorithm Analysis and Problem Complexity. --- Algebraic Geometry. --- Algebraic geometry --- Geometry --- Software, Computer --- Computer systems --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Digital techniques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computational geometry emerged as a discipline in the seventies and has had considerable success in improving the asymptotic complexity of the solutions tobasicgeometricproblemsincludingconstructionsofdatastructures,convex hulls, triangulations, Voronoi diagrams and geometric arrangements as well as geometric optimisation. However, in the mid-nineties, it was recognized that the computational geometry techniques were far from satisfactory in practice and a vigorous e?ort has been undertaken to make computational geometry more practical. This e?ort led to major advances in robustness, geometric software engineering and experimental studies, and to the development of a large library of computational geometry algorithms, Cgal. The goal of this book is to take into consideration the multidisciplinary nature of the problem and to provide solid mathematical and algorithmic foundationsfore?ectivecomputationalgeometryforcurvesandsurfaces. This book covers two main approaches. In a ?rst part, we discuss exact geometric algorithms for curves and s- faces. We revisit two prominent data structures of computational geometry, namely arrangements (Chap. 1) and Voronoi diagrams (Chap. 2) in order to understand how these structures, which are well-known for linear objects, behave when de?ned on curved objects. The mathematical properties of these structures are presented together with algorithms for their construction. To ensure the e?ectiveness of our algorithms, the basic numerical computations that need to be performed are precisely speci?ed, and tradeo?s are considered between the complexity of the algorithms (i. e. the number of primitive calls), and the complexity of the primitives and their numerical stability. Chap.

Computer. Automation --- informatica --- wiskunde

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Information Technology --- Computer Science (Hardware & Networks)