scispace - formally typeset
Search or ask a question
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
More filters
01 Jan 1989
TL;DR: This thesis presents the Tri-cyclic data structure that is a vertex-based non-2-manifold boundary representation scheme and a bottom-up intersection algorithm for linear and planar facet non- 2- manifold models has been developed.
Abstract: A geometric modeling system that extends modeling to include non-2-manifold objects is useful for several reasons. Various levels of representation, i.e., wireframe models, surface models, and solid models, are handled uniformly in a non-2-manifold modeling environment. This uniformity enhances current CAD systems by allowing a proper choice in level of representation, and provides a smooth transition between various levels of representation. Solutions to some geometry-related problems can be obtained more easily by mixing non-2-manifold entities with 2-manifold entities in the problem's model. This thesis presents the Tri-cyclic data structure that is a vertex-based non-2-manifold boundary representation scheme. A set of new topological elements is introduced for the neighborhood classification around a vertex. The data structure explicitly represents the adjacency information around non-2-manifold vertices and edges. A set of point set operators for the manipulation of models is also presented in this thesis. The point set operators operate on vertex, edge, face and region which are defined as point set elements. Point set elements of a model collectively and exhaustively cover entire R3. As the basis for point set operations, a bottom-up intersection algorithm for linear and planar facet non-2-manifold models has been developed. The algorithm operates by intersecting entities in an ordered manner from vertex to edge then face elements in contrast to intersecting pairs of faces in 2-manifold boundaries. Singular intersections are systematically handled by determining if an entity is within a tolerance region. 2-manifold models and non-2-manifold models are handled by the algorithm in a uniform manner. A system based on the representation scheme, including the point set operators and the intersection algorithm, has been implemented. This implementation is restricted to linear elements and planar facets. The limitations are discussed in the implementation sections.

21 citations

Journal ArticleDOI
TL;DR: A number of tools are introduced that can be used to obtain a stronger conclusion on the existence of an implicit representation of graphs and are applied to reveal new hereditary classes with the factorial speed of growth.

21 citations

Journal ArticleDOI
TL;DR: In this article, it was shown that almost all dumbbell graphs (without cycle C 4 as a subgraph) are determined by adjacency spectrum invariants for (r, r + 1 ) -almost regular graphs.

21 citations

Journal ArticleDOI
TL;DR: In this paper, a ternary algebra formed by three-dimensional arrays with entries from an arbitrary field is investigated, and the notion of identity pair and inverse pair is defined and methods for finding inverse pairs are developed.

21 citations

Journal ArticleDOI
TL;DR: A new fast technique for verifying Chernikov rules in Fourier-Motzkin elimination is proposed, which is an adaptation of the “graph” test for adjacency in the double description method.
Abstract: The problem of eliminating unknowns from a system of linear inequalities is considered. A new fast technique for verifying Chernikov rules in Fourier-Motzkin elimination is proposed, which is an adaptation of the “graph” test for adjacency in the double description method. Numerical results are presented that confirm the effectiveness of this technique.

21 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
82% related
Probabilistic logic
56K papers, 1.3M citations
82% related
Cluster analysis
146.5K papers, 2.9M citations
81% related
Matrix (mathematics)
105.5K papers, 1.9M citations
81% related
Robustness (computer science)
94.7K papers, 1.6M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023209
2022439
2021283
2020280
2019296
2018232