Transforming geometric algorithms into effective computer programs is a difficult task. This transformation is particularly made hard by the basic assumptions of most theoretical geometric algorithms concerning the handling of robustness issues, namely issues related to arithmetic precision and degenerate input. We start with a discussion of the gap between the theory and practice of geometric ...

OBJECTIVES Wood dust data held in the Health and Safety Executive (HSE) National Exposure DataBase (NEDB) were reviewed to investigate the long-term changes in inhalation exposure from 1985 to 2005. In addition, follow-up sampling measurements were obtained from selected companies where exposure measurements had been collected prior to 1994, thereby providing a follow-up period of at least 10 y...

We present a new method to register a pair of visible (ViS) and infrared (IR) images. Unlike most of existing systems that align interest points of two images, we align lines derived from edge pixels, because the interest points extracted from both images are not always identical, but most major edges detected from one image do appear in another image. To solve feature matching problem, we emph...

This document has four purposes. it is a tutorial in parametric curve and surface representations, it describes a number of algorithms for generating both shaded and line-drawn pictures of bivariate surfaces and trivariate volumes, it explicitly gives transformations between all of the widely used curve and surface representations, and it proposes a solution to the problem of displaying the res...

We formulate an approach to the geometry of Riemann–Cartan spaces provided with nonholonomic distributions defined by generic off-diagonal and nonsymmetric metrics inducing effective nonlinear and affine connections. Such geometries can be modelled by moving nonholonomic frames on (pseudo) Riemannian manifolds and describe various types of nonholonomic Einstein, Eisenhart–Moffat and Finsler–Lag...

In this paper, the four-precision-point geometric design problem of serial-link robot manipulators with three revolute joints is solved using a polynomial continuation method. At each precision point, the end-effector spatial locations are defined. The dimensions of the geometric parameters of the 3R manipulator are computed so that the manipulator’s end-effector will be able to reach these fou...

In this paper we discuss the use of models of space in mixed-reality systems. By model of space we mean a distinguishable geometric or symbolic description associated with a physical space. We outline several types of model that might exist, how they are surveyed or otherwise authored, how they are represented to the users and how the underlying middleware and sensors support them. We show that...

This paper studies the construction of geometric integrators for nonholonomic systems. We derive the nonholonomic discrete Euler-Lagrange equations in a setting which permits to deduce geometric integrators for continuous nonholonomic systems (reduced or not). The formalism is given in terms of Lie groupoids, specifying a discrete Lagrangian and a constraint submanifold on it. Additionally, it ...

When a beam of light undergoes a cycle of transformations, then both the electric field component and the quantum state acquire, in addition to a dynamical phase, a geometric phase. The latter depends only on geometric properties such as the enclosed area [ 1 ], or the distance and length [2 ] of the curve that represents the sequence of transformations in an appropriate parameter space. So far...

This paper describes the modifications of Geometric Hashing pattern recognition scheme to fulfill the requirements of real-time industrial applications in recognizing general shapes with large numbers of feature points. The scheme is robust to variety of object transformations and partial occlusion. By decomposing the pattern into sub-patterns, using a plurality of hash tables to record the sub...