Lidar In Coastal Storm Surge Modeling: Modeling Linear Raised Features

A method for extracting linear raised features from laser scanned altimetry (LiDAR) datasets is presented. The objective is to automate the method so that elements in a coastal storm surge simulation finite element mesh might have their edges aligned along vertical terrain features. Terrain features of interest are those that are high and long enough to form a hydrodynamic impediment while being narrow enough that the features might be straddled and not modeled if element edges are not purposely aligned. These features are commonly raised roadbeds but may occur due to other manmade alterations to the terrain or natural terrain. The implementation uses the TauDEM watershed delineation software included in the MapWindow open source Geographic Information System to initially extract watershed boundaries. The watershed boundaries are then examined computationally to determine which sections warrant inclusion in the storm surge mesh. Introductory work towards applying image analysis techniques as an alternate means of vertical feature extraction is presented as well. Vertical feature lines extracted from a LiDAR dataset for Manatee County, Florida are included in a limited storm surge finite element mesh for the county and Tampa Bay. Storm surge simulations using the ADCIRC-2DDI model with two meshes, one which includes linear raised features as element edges and one which does not, verify the usefulness of the method

I/O-Efficient Construction of Constrained Delaunay Triangulations

In this paper, we designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations. If the number of constraining segments is smaller than the memory size, our algorithm runs in expected O ( N B logM/B N B) I/Os for triangulating N points in the plane, where M is the memory size and B is the disk block size. If there are more constraining segments, the theoretical bound does not hold, but in practice the performance of our algorithm degrades gracefully. Through an extensive set of experiments with both synthetic and real data, we show that our algorithm is significantly faster than existing implementations, and is also insensitive to various data features such as point distributions and segment lengths.

I/O-Efficient Construction of Constrained Delaunay Triangulations

In this paper, we designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations. If the number of constraining segments is smaller than the memory size, our algorithm runs in expected O ( N B logM/B N B) I/Os for triangulating N points in the plane, where M is the memory size and B is the disk block size. If there are more constraining segments, the theoretical bound does not hold, but in practice the performance of our algorithm degrades gracefully. Through an extensive set of experiments with both synthetic and real data, we show that our algorithm is significantly faster than existing implementations

Aplicación del método PFEM a la simulación de procesos de transferencia propios de la industria pulvimetalúrgica

El objetivo primario del trabajo es desarrollar desde el enfoque de la ingeniería la metodología PFEM, la cual se fundamenta en una reinterpretación alternativa los métodos clásicos masivamente aceptados. Como objetivos adicionales de la monografía se tienen aplicar el PFEM a problemas complejos pertenecientes a la pulvimetalurgia, exhibir sus potencialidades en otros campos de la ingeniería y vislumbrar algunas líneas de investigación y desarrollo futuros