Topic
Adjacency list
About: Adjacency list is a research topic. Over the lifetime, 4419 publications have been published within this topic receiving 78449 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, the authors investigated the effect of five meshing parameters on the analysis solving time and the analysis quality, including the adjacency ratio and minimum and maximum element size.
Abstract: This work investigates the use of hierarchical mesh decomposition strategies for topology optimisation using bi-directional evolutionary structural optimisation algorithm. The proposed method uses a dual mesh system that decouples the design variables from the finite element analysis mesh. The investigation focuses on previously unexplored areas of these techniques to investigate the effect of five meshing parameters on the analysis solving time (i.e. computational effort) and the analysis quality (i.e. solution optimality). The foreground mesh parameters, including adjacency ratio and minimum and maximum element size, were varied independently across solid and void domain regions. Within the topology optimisation, strategies for controlling the mesh parameters were investigated. The differing effects of these parameters on the efficiency and efficacy of the analysis and optimisation stages are discussed, and recommendations are made for parameter combinations. Some of the key findings were that increasing the adjacency ratio increased the efficiency only modestly – the largest effect was for the minimum and maximum element size parameters – and that the most dramatic reduction in solve time can be achieved by not setting the minimum element size too low, assuming mapping onto a background mesh with a minimum element size of 1.
26 citations
TL;DR: This paper presents an unsupervised segmentation method applicable to both 2D and 3D images achieved by a bottom-up hierarchical analysis to progressively agglomerate pixels/voxels in the image into non-overlapped homogeneous regions characterised by a linear signal model.
26 citations
17 Mar 1999
TL;DR: This paper proposes a model for digital topology based on the notion of order and discrete topology and "validates" this model by considering the two fundamental notions of surface and simple point.
Abstract: In the framework known as digital topology, two different adjacency relations are used for structuring the discrete space Zn.In this paper, we propose a model for digital topology based on the notion of order and discrete topology. We "validate" our model by considering the two fundamental notions of surface and simple point. At last, we give the different possible configurations that may appear in 2-and 3- dimensional surfaces in Z4 which correspond to our model.
25 citations
01 Apr 1985
TL;DR: An algorithm which determines the adjacent cells as it constructs a cad of the plane for three-dimensional space is given.
Abstract: Given a set of r-variate integral polynomials, a cylindrical algebraic decomposition (cad) of euclidean r-space Er is a certain partition of Er into connected subsets compatible with the zeros of the polynomials Each subset is a cell Two cells of a cad are adjacent if their union is connected In applications of cad's, one often wishes to know the pairs of adjacent cells In a previous paper we gave an algorithm which determines the adjacent cells as it constructs a cad of the plane We give such an algorithm here for three-dimensional space
25 citations
TL;DR: The proposed scheme, called Traversal & Jumping, assigns to the n vertices of any bounded degree tree distinct binary labels of log 2 n + O ( 1 ) bits in O ( n ) time such that the authors can compute adjacency between two vertices only from their labels.
25 citations