A reliable algorithm for computing the topological degree of a mapping in R2

In this paper, we present a method to reliably compute the topological degree of a mapping in the plane, over a simple closed polygon. The method is based on Henrici's argument principle, and computes the degree using the winding number concept in range arithmetic. The algorithm is then applied to the root computation of a univariate polynomial. The proposed algorithms are demonstrated with examples. © 2007 Elsevier Inc. All rights reserved

Monitoring harmful algal blooms in Singapore: Developing a HABs observing system

10.1109/OCEANS-Yeosu.2012.6263428Program Book - OCEANS 2012 MTS/IEEE Yeosu: The Living Ocean and Coast - Diversity of Resources and Sustainable Activities

3D-surface reconstruction for partially submerged marine structures using an autonomous surface vehicle

10.1109/IROS.2011.6048609IEEE International Conference on Intelligent Robots and Systems3551-355785RB

Efficient One-Sided Linearization of Spline Geometry

This paper surveys a new, computationally efficient technique for linearizing curved spline geometry, bounding such geometry from one side and constructing curved spline geometry that stays to one side of a barrier or inside a given channel. Combined with a narrow error bound, these reapproximations tightly couple linear and nonlinear representations and allow them to be substituted when reasoning about the other. For example, a subdividable linear efficient variety enclosure (sleve, pronounced like Steve) of a composite spline surface is a pair of matched triangulations that sandwich a surface and may be used for interference checks. The average of the sleve components, the mid-structure, is a good max-norm linearization and, similar to a control polytope, has a welldefined, associated curved geometry representation. Finally, the ability to fit paths through given channels or keep surfaces near but outside forbidden regions, allows extending many techniques of linear computational geometry to the curved, nonlinear realm

Distributed information and computation in scientific and engineering environments

The NSF Invitational Workshop on Distributed Information, Computation, and Process Management for Scientific and Engineering Environments (DICPM) brought together domain specialists from engineering and the ocean, atmospheric, and space sciences involved in the development and use of simulations of complex systems, and computer scientists working on distributed repositories, visualization, and resource management. The objective was to formulate directions for research efforts to facilitate effective collaboration and to help increase access to information and sharing of results and tools useful in large-scale, distributed, multidisciplinary scientific and engineering environments. Three broad problem areas inhibit such activities: (1) Computational, e.g, insufficient infrastructure for the sharing of very large amounts of information, results, and tools; (2) Structural institutional barriers, e.g., funding, publication, and promotion policies; and (3) Social, e.g., communication barriers stemming from narrow specialization. The participants supported specific steps to address these problems: explicit support and incentives for multidisciplinary activities; the development of digital libraries to enhance interdisciplinary communication and understanding; and development of a "virtual scientific marketplace" to disseminate tools, results, and expertise