Search results

Filters

  • Journals
  • Date

Search results

Number of results: 3
items per page: 25 50 75
Sort by:

Abstract

In this paper an alternative procedure to vibro-acoustics study of beam-type structures is presented. With this procedure, it is possible to determine the resonant modes, the bending wave propagation velocity through the study of the radiated acoustic field and their temporal evolution in the frequency range selected. As regards the purely experimental aspect, it is worth noting that the exciter device is an actuator similar to is the one employed in distributed modes loudspeakers; the test signal used is a pseudo random sequence, in particular, an MLS (Maximum Length Sequence), facilitates post processing. The study case was applied to two beam-type structures made of a sandstone material called Bateig. The experimental results of the modal response and the bending propagation velocity are compared with well-established analytical solution: Euler-Bernoulli and Timoshenko models, and numerical models: Finite Element Method – FEM, showing a good agreement.
Go to article

Abstract

The processing of cartographic data demands human involvement. Up-to-date algorithms try to automate a part of this process. The goal is to obtain a digital model, or additional information about shape and topology of input geometric objects. A topological skeleton is one of the most important tools in the branch of science called shape analysis. It represents topological and geometrical characteristics of input data. Its plot depends on using algorithms such as medial axis, skeletonization, erosion, thinning, area collapse and many others. Area collapse, also known as dimension change, replaces input data with lower-dimensional geometric objects like, for example, a polygon with a polygonal chain, a line segment with a point. The goal of this paper is to introduce a new algorithm for the automatic calculation of polygonal chains representing a 2D polygon. The output is entirely contained within the area of the input polygon, and it has a linear plot without branches. The computational process is automatic and repeatable. The requirements of input data are discussed. The author analyzes results based on the method of computing ends of output polygonal chains. Additional methods to improve results are explored. The algorithm was tested on real-world cartographic data received from BDOT/GESUT databases, and on point clouds from laser scanning. An implementation for computing hatching of embankment is described.
Go to article

Abstract

This paper presents a piecewise line generalization algorithm (PG) based on shape characteristic analysis. An adaptive threshold algorithm is used to detect all corners, from which key points are selected. The line is divided into some segments by the key points and generalized piecewise with the Li-Openshaw algorithm. To analyze the performance, line features with different complexity are used. The experimental results compared with the DP algorithm and the Li-Openshaw algorithm show that the PG has better performance in keeping the shape characteristic with higher position accuracy.
Go to article

This page uses 'cookies'. Learn more