Reconstrução e geração de malhas em estruturas biomecânicas tridimensionais para análise por elemento finitos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Nas malhas do leitor: um estudo de teses e dissertações sobre leitura/recepção de textos (1980-2003)

Pós-graduação em Letras - FCLAS

Implementação de um gerador tridimensional de malhas de elementos finitos, com aplicações à simulação computacional em odontologia

Pós-graduação em Matemática - IBILCE

A relação entre competitividade e território no circuito das malhas do sul de Minas

Pós-graduação em Geografia - IGCE

Manifestações da governança territorial no Brasil: uma análise do 'circuito das águas paulista' e do 'circuito das malhas do sul de Minas Gerais'

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Simplificação de malhas visando representações em multirresolução

The representation of real objects in virtual environments has applications in many areas, such as cartography, mixed reality and reverse engineering. The generation of these objects can be performed through two ways: manually, with CAD (Computer Aided Design) tools, or automatically, by means of surface reconstruction techniques. The simpler the 3D model, the easier it is to process and store it. However, this methods can generate very detailed virtual elements, that can result in some problems when processing the resulting mesh, because it has a lot of edges and polygons that have to be checked at visualization. Considering this context, it can be applied simplification algorithms to eliminate polygons from resulting mesh, without change its topology, generating a lighter mesh with less irrelevant details. The project aimed the study, implementation and comparative tests of simplification algorithms applied to meshes generated through a reconstruction pipeline based on point clouds. This work proposes the realization of the simplification step, like a complement to the pipeline developed by (ONO et al., 2012), that developed reconstruction through cloud points obtained by Microsoft Kinect, and then using Poisson algorithm

Influência do uso de malhas de sombreamento azul, vermelha e preta no desenvolvimento inicial do pepino Taiko

Cucumber (Cucumis sativus L.) is a plant of the Cucurbitaceae family of great commercial importance and their culture is widespread throughout the country. The production of vegetables, high-quality care begins with training ranging from seedlings and shading techniques have an important role in creating environments more conducive to the production of seedlings and many researchers and producers of seedlings have opted for the use of color shading screens, making this way, the wavelength and the amount of incident energy are changed in favor of the plants. Work will be performed at the Department of Forest Sciences, Faculty of Agricultural Sciences, Universidade Estadual Paulista (UNESP), Botucatu campus. The statistical design will be in three blocks, each containing 100 plots of each treatment (seedlings covered with blue screen, red and black). Evaluations of dry mass and height will be made at 7, 14, 21 and 28 days after emergence, and 5 will be selected seedlings of each treatment. At 14 and 28 DAE was measured, and SPAD chlorophyll content at 30 DAE, was evaluated by measuring gas exchange in the second pair of leaves, fully expanded for each plant, which was put in a chamber controlled with infrared gas analyzer (IRGA LI 6400, Licor) to perform measurements of photosynthesis. Treatment with black shading showed statistically better results for total dry matter, plant height, SPAD chlorophyll content and net assimilation of CO2, showing a better quality seedlings and its use is recommended in the cultivation of cucumber Taiko

Study of cerebral gene expression densities using Voronoi analysis

As the available public cerebral gene expression image data increasingly grows, the demand for automated methods to analyze such large amount of data also increases. An important study that can be carried out on these data is related to the spatial relationship between gene expressions. Similar spatial density distribution of expression between genes may indicate they are functionally correlated, thus the identification of these similarities is useful in suggesting directions of investigation to discover gene interactions and their correlated functions. In this paper, we describe the use of a high-throughput methodology based on Voronoi diagrams to automatically analyze and search for possible local spatial density relationships between gene expression images. We tested this method using mouse brain section images from the Allen Mouse Brain Atlas public database. This methodology provided measurements able to characterize the similarity of the density distribution between gene expressions and allowed the visualization of the results through networks and Principal Component Analysis (PCA). These visualizations are useful to analyze the similarity level between gene expression patterns, as well as to compare connection patterns between region networks. Some genes were found to have the same type of function and to be near each other in the PCA visualizations. These results suggest cerebral density correlations between gene expressions that could be further explored. (C) 2011 Elsevier B.V. All rights reserved.

Connecting red cells in a bichromatic Voronoi diagram

Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper is to calculate the minimum value of wR such that the union of the red Voronoi cells in the weighted Voronoi diagram of S is a connected set. The problem is solved for the multiplicatively-weighted Voronoi diagram in O((n+m)^2 log(nm)) time and for the additively-weighted Voronoi diagram in O(nmlog(nm)) time.

Zone design of specific sizes using adaptive additively weighted voronoi diagrams

Territory or zone design processes entail partitioning a geographic space, organized as a set of areal units, into different regions or zones according to a specific set of criteria that are dependent on the application context. In most cases, the aim is to create zones of approximately equal sizes (zones with equal numbers of inhabitants, same average sales, etc.). However, some of the new applications that have emerged, particularly in the context of sustainable development policies, are aimed at defining zones of a predetermined, though not necessarily similar, size. In addition, the zones should be built around a given set of seeds. This type of partitioning has not been sufficiently researched; therefore, there are no known approaches for automated zone delimitation. This study proposes a new method based on a discrete version of the adaptive additively weighted Voronoi diagram that makes it possible to partition a two-dimensional space into zones of specific sizes, taking both the position and the weight of each seed into account. The method consists of repeatedly solving a traditional additively weighted Voronoi diagram, so that each seed?s weight is updated at every iteration. The zones are geographically connected using a metric based on the shortest path. Tests conducted on the extensive farming system of three municipalities in Castile-La Mancha (Spain) have established that the proposed heuristic procedure is valid for solving this type of partitioning problem. Nevertheless, these tests confirmed that the given seed position determines the spatial configuration the method must solve and this may have a great impact on the resulting partition.

Solução rasterizada para o problema de empacotamento de fita irregular utilizando a Montanha Voronoi.

O empacotamento irregular de fita é um grupo de problemas na área de corte e empacotamento, cuja aplicação é observada nas indústrias têxtil, moveleira e construção naval. O problema consiste em definir uma configuração de itens irregulares de modo que o comprimento do contêiner retangular que contém o leiaute seja minimizado. A solução deve ser válida, isto é, não deve haver sobreposição entre os itens, que não devem extrapolar as paredes do contêiner. Devido a aspectos práticos, são admitidas até quatro orientações para o item. O volume de material desperdiçado está diretamente relacionado à qualidade do leiaute obtido e, por este motivo, uma solução eficiente pressupõe uma vantagem econômica e resulta em um menor impacto ambiental. O objetivo deste trabalho consiste na geração automática de leiautes de modo a obter níveis de compactação e tempo de processamento compatíveis com outras soluções na literatura. A fim de atingir este objetivo, são realizadas duas propostas de solução. A primeira consiste no posicionamento sequencial dos itens de modo a maximizar a ocorrência de posições de encaixe, que estão relacionadas à restrição de movimento de um item no leiaute. Em linhas gerais, várias sequências de posicionamentos são exploradas com o objetivo de encontrar a solução mais compacta. Na segunda abordagem, que consiste na principal proposta deste trabalho, métodos rasterizados são aplicados para movimentar itens de acordo com uma grade de posicionamento, admitindo sobreposição. O método é baseado na estratégia de minimização de sobreposição, cujo objetivo é a eliminação da sobreposição em um contêiner fechado. Ambos os algoritmos foram testados utilizando o mesmo conjunto de problemas de referência da literatura. Foi verificado que a primeira estratégia não foi capaz de obter soluções satisfatórias, apesar de fornecer informações importantes sobre as propriedades das posições de encaixe. Por outro lado, a segunda abordagem obteve resultados competitivos. O desempenho do algoritmo também foi compatível com outras soluções, inclusive em casos nos quais o volume de dados era alto. Ademais, como trabalho futuro, o algoritmo pode ser estendido de modo a possibilitar a entrada de itens de geometria genérica, o que pode se tornar o grande diferencial da proposta.

On the stability of Voronoi cells

Let T be a given subset of ℝ n , whose elements are called sites, and let s∈T. The Voronoi cell of s with respect to T consists of all points closer to s than to any other site. In many real applications, the position of some elements of T is uncertain due to either random external causes or to measurement errors. In this paper we analyze the effect on the Voronoi cell of small changes in s or in a given non-empty set P⊂T\{s}. Two types of perturbations of P are considered, one of them not increasing the cardinality of T. More in detail, the paper provides conditions for the corresponding Voronoi cell mappings to be closed, lower and upper semicontinuous. All the involved conditions are expressed in terms of the data.

Voronoi cells via linear inequality systems

The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.