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
01 Jul 1985
TL;DR: A hierarchical graph structure based on the face adjacency graph, which provides a representation of an object at different levels of detail is described, consistent with the stepwise refinement process through which the object description is produced.
Abstract: A relational graph structure based on a boundary representation of solid objects is described. In this structure, called face adjacency graph, nodes represent object faces, whereas edges and vertices are encoded into arcs and hyperarcs. Based on the face adjacency graph, we define a set of primitive face-oriented Euler operators, and a set of macrooperators for face manipulation, which allow a compact definition and an efficient updating of solid objects. We briefly describe a hierarchical graph structure based on the face adjacency graph, which provides a representation of an object at different levels of detail. Thus it is consistent with the stepwise refinement process through which the object description is produced.
152 citations
TL;DR: This paper describes and compares three parallel algorithms for solving sparse triangular systems of equations and considers both row-wise and jagged diagonal storage for the offdiagonal blocks.
Abstract: This paper describes and compares three parallel algorithms for solving sparse triangular systems of equations. These methods involve some preprocessing overhead and are primarily of interest in solving many systems with the same coefficient matrix. The first approach is to use a fixed blocksize and form the inverse of the diagonal blocks. The second approach is to use a variable blocksize and reorder the unknowns so that the diagonal blocks are diagonal matrices. The latter technique is called level scheduling because of how it is represented in the adjacency graph, and both row-wise and jagged diagonal storage for the off-diagonal blocks are considered. These techniques are analyzed for general parallel computers and experiments are presented for the eight-processor Alliant FX/8.
149 citations
TL;DR: A class of bipartite containment tracking problems for leader-following networks associated with signed digraphs, which admits multiple leaders which can be not only stationary but also dynamically changing via interactions between them and their neighbored leaders is considered.
148 citations
Posted Content•
TL;DR: In this article, the authors discuss the work of many authors on various matrices used to study signed graphs, concentrating on adjacency and incidence matrices and the closely related topics of Kirchhoff (`Laplacian') matrices, line graphs, and very strong regularity.
Abstract: I discuss the work of many authors on various matrices used to study signed graphs, concentrating on adjacency and incidence matrices and the closely related topics of Kirchhoff (`Laplacian') matrices, line graphs, and very strong regularity.
148 citations
TL;DR: A map between squares and disks that associates concentric squares with concentric circles is presented that preserves adjacency and fractional area, and has proven useful in many sampling applications where correspondences must be maintained between the two shapes.
Abstract: This paper presents a map between squares and disks that associates concentric squares with concentric circles. This map preserves adjacency and fractional area, and has proven useful in many sampling applications where correspondences must be maintained between the two shapes. The paper also provides code to compute the map that minimizes branching and is robust for all inputs. Finally, it extends the map to the hemisphere. Though this map has been used in publications before, details of its computation have never previously been published.
148 citations