Extending a differential total least squares method for range flow estimation we present an iterative regularisation approach to compute dense range flow fields. We demonstrate how this algorithm can be used to detect motion discontinuities. This can can be used to segment the data into independently moving regions. The different types of aperture problem encountered are discussed. Our regularisation scheme then takes the various types of flow vectors and combines them into a smooth flow field within the previously segmented regions. A quantitative performance analysis is presented on both synthetic and real data. The proposed algorithm is also applied to range data from castor oil plants obtained with the Biris laser range sensor to study the 3-D motion of plant leaves.

We present an algorithm for determining the next best position of a range sensor in 3D space for incrementally recovering an indoor scene.

Pareto surfaces in the performance space determine the range of feasible performance values for a circuit topology in a given technology. We present a non-dominated sorting based global optimization algorithm to generate the nominal pareto front efficiently using a simulator-in-a-loop approach. The solutions on this pareto front combined with efficient Monte Carlo approximation ideas are then used to compute the yield-aware pareto fronts. We show experimental results for both the nominal and yield-aware pareto fronts for power and phase noise for a voltage controlled oscillator (VCO) circuit. The presented methodology computes yield-aware pareto fronts in approximately 5-6 times the time required for a single circuit synthesis run and is thus practically efficient. We also show applications of yield-aware paretos to find the optimal VCO circuit to meet the system level specifications of a phase locked loop.

To support 3D architectural modeling, geometric constraints are introduced. Explicit and implicit geometric relations between building elements can be expressed by the designer and imposed on the 3D geometry of the design. A complete set of constraint types is defined. Constraints are satisfied through Numerical Methods to achieve that the model responds to the designers' actions in a user-intuitive way. Two prototype systems demonstrate the application of geometric constraints in the architectural domain. Keywords: CAD, Geometric constraints, Design systems 1

We present a total least squares based differential method for the estimation of 3D range flow from a sequence of range images. We address the various manifestations of the aperture problem encountered with this type of data. It is described how they can be detected and how the appropriate normal flow can be computed. The performance of the proposed method is assessed on both synthetic and real data.

Wepresent an algorithm for determining the next best position of a range sensor in 3D space for incrementally recovering an indoor scene.

A determinacao de pontos de intersecao e contatos entre fronteiras de objetos nao e uma tarefa simples. Uma forma de facilitar essa operacao usa-se estruturas hierarquicas para issolar rapidamente os pedacos de segmentos em possvel intersecao, para finalmente se computar localmente os pontos de contato. Neste trabalho formula-se um novo metodo de representacao em estrutura hierarquica de caixas orientadas envolventes adaptado e ajustadamente de segmentos de fronteiras de objetos definidos por curvas B-splines cubicas fechadas com perturbacoes. Cada par de caixas adjacentes de um nvel define uma outra caixa orientada. Cada caixa e computada de forma adatada e ajustada aos segmentos de fronteira do objeto usando-se indicadores estatsticos de segunda ordem. O resultado computacional, em anima coes de objetos rgidos de geometria complexa em computacao grafica, mostra que o metodo formulado e eficiente comparado com outros metodos existentes.

A determinacao de pontos de intersecao e contatos entre fronteiras de objetos nao e uma tarefa simples. Uma forma de facilitar essa operacao usa-se estruturas hierarquicas para issolar rapidamente os pedacos de segmentos em possvel intersecao, para finalmente se computar localmente os pontos de contato. Neste trabalho formula-se um novo metodo de representacao em estrutura hierarquica de caixas orientadas envolventes adaptado e ajustadamente de segmentos de fronteiras de objetos definidos por curvas B-splines cubicas fechadas com perturbacoes. Cada par de caixas adjacentes de um nvel define uma outra caixa orientada. Cada caixa e computada de forma adatada e ajustada aos segmentos de fronteira do objeto usando-se indicadores estatsticos de segunda ordem. O resultado computacional, em anima coes de objetos rgidos de geometria complexa em computacao grafica, mostra que o metodo formulado e eficiente comparado com outros metodos existentes.

In this paper a quadratic convergence quasi-Newton method for unconstrained optimization is introduced. It is based on an appropriate approximation of Hessian matrix in Newton’s method by another one, named Pivot Hessian. The innovation of new method is that the proposed Hessian is a matrix close to Newton’s one evaluated at other proper selected points, named pivot points, with generally better behavior, which are issued via a low cost componentwise technique. The important key point of the new algorithm is that although it is a quasi-Newton method, at the same time, from another point of view, it may be faced and as a new Newton’s method. Thus, the new strategy results to an algorithm which incorporates the advantages of both Newton and quasi-Newton methods, as well as reduces their disadvantages. So, on the one hand it ensures the quadratic convergence and on the other hand it enlarges the domain of convergence, like a globalization strategy, accelerating Newton’s method even from points far away from the solution point. Moreover, as it is known, in singular, nearly singular or ill-conditioned Hessian matrices, the iteration must be modified. Our modification seems to face such cases. The method has been implementing in well-known test functions with efficient and promising results. 2

Relevant distance between two different instances of the same potential energy in protein folding