Halperin Robust Geometric Computing in Motion
نویسنده
چکیده
Transforming a geometric algorithm into an effective computer program is a difficult task. This transformation is particularly made hard by the basic assumptions of most theoretical geometric algorithms concerning complexity measures and (more crucially) the handling of robustness issues, namely issues related to arithmetic precision and degenerate input. The paper starts with a discussion of the gap between the theory and practice of geometric algorithms, together with a brief review of existing solutions to some of the problems that this dichotomy brings about. We then turn to an overview of the CGAL project and library. The CGAL project is a joint effort by a number of research groups in Europe and Israel to produce a robust software library of geometric algorithms and data structures. The library is now available for use with significant functionality. We describe the main goals and results
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملRobust Hybrid Motion Force Control Algorithm for Robot Manipulators
In this paper we present a robust hybrid motion/force controller for rigid robot manipulators. The main contribution of this paper is that the proposed hybrid control system is able to accomplish motion objectives in free directions and force objectives in constrained directions under parametric uncertainty both in robot dynamics and stiffness constraint constant. Also, the given scheme is prov...
متن کاملExact solutions for Fokker-Plank equation of geometric Brownian motion with Lie point symmetries
In this paper Lie symmetry analysis is applied to find new solution for Fokker Plank equation of geometric Brownian motion. This analysis classifies the solution format of the Fokker Plank equation.
متن کاملNew perspective on sampling-based motion planning via random geometric graphs
Roadmaps constructed by many sampling-based motion planners coincide, in the absence of obstacles, with standard models of random geometric graphs (RGGs). Those models have been studied for several decades and by now a rich body of literature exists analyzing various properties and types of RGGs. In their seminal work on optimal motion planning Karaman and Frazzoli [31] conjectured that a sampl...
متن کامل