The relative neighbourhood graph of a finite planar set
From MaRDI portal
Publication:1141155
DOI10.1016/0031-3203(80)90066-7zbMath0437.05050OpenAlexW2063295648WikidataQ29307742 ScholiaQ29307742MaRDI QIDQ1141155
Publication date: 1980
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-3203(80)90066-7
algorithmspattern recognitiontriangulationsDelaunay triangulationminimal spanning treegeometric probabilitygeometric complexityrelative neighbourhood graphcomputational perceptiondot patterns
Related Items
Population-driven urban road evolution dynamic model, Depth functions and mutidimensional medians on minimal spanning trees, Constructing competitive tours from local information, Computing relative neighbourhood graphs in the plane, A linear-time construction of the relative neighborhood graph from the Delaunay triangulation, Constructing competitive tours from local information, Proximity drawings in polynomial area and volume, Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors, Partial dissimilarities with application to clustering, The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric, A Continuous Strategy for Collisionless Gathering, A linear-time construction of the relative neighborhood graph within a histogram, PROXIMITY GRAPHS: E, δ, Δ, χ AND ω, A survey of constrained classification, Minimum weight euclidean matching and weighted relative neighborhood graphs, PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, Good triangulations yield good tours, The expected size of some graphs in computational geometry, GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING, A linear expected-time algorithm for computing planar relative neighbourhood graphs, Optimization of the movements of a component placement machine, A graph-theoretical clustering method based on two rounds of minimum spanning trees, Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\), Structure-activity maps for visualizing the graph variables arising in drug design, A simple linear-time algorithm for computing the ring and MST of unimodal polygons, Characterizing proximity trees, Complexity, convexity, and unimodality, The rectangle of influence drawability problem, $$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$, A strong law of large numbers for random biased connected graphs, Intersections with random geometric objects, Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes, Shape-faithful graph drawings, An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics, Classification by restricted random walks, Tuned communicability metrics in networks. The case of alternative routes for urban traffic, A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles, A divide-and-conquer algorithm for constructing relative neighborhood graph, Graph theoretical clustering based on limited neighbourhood sets, Coloring certain proximity graphs, Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics, Comparison of relative density of two random geometric digraph families in testing spatial clustering, A continuous strategy for collisionless gathering, On Vertex- and Empty-Ply Proximity Drawings, Drawing Big Graphs Using Spectral Sparsification, Constructing the relative neighborhood graph in 3-dimensional Euclidean space, RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS, Position-Based Routing in Wireless Ad Hoc and Sensor Networks, Edge density of new graph types based on a random digraph family, Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis, Local solutions for global problems in wireless networks, On the expected maximum degree of Gabriel and Yao graphs, The \(\gamma\)-neighborhood graph, Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs, Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs, Relative neighborhood graphs in three dimensions, Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests, Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association, Time-optimum packet scheduling for many-to-one routing in wireless sensor networks, Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family, Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems, Swarm intelligence for self-organized clustering, Closed rectangle-of-influence drawings for irreducible triangulations, Fast algorithms for computing \(\beta\)-skeletons and their relatives., The distribution of the relative arc density of a family of interval catch digraph based on uniform data, Weighted \({\mathcal A}\)-shape: A descriptor of the shape of a point set, An investigation of new graph invariants related to the domination number of random proximity catch digraphs, Extension of one-dimensional proximity regions to higher dimensions, Semantic fusion of laser and vision in pedestrian detection, A new family of proximity graphs: class cover catch digraphs, Parsimonious Hidden Markov Models for Matrix-Variate Longitudinal Data, Essential Constraints of Edge-Constrained Proximity Graphs, Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations, An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations, ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS, Growing spanning trees in plasmodium machines, On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces, Physarum in silicon: the Greek motorways study, Affine invariant triangulations, Lens data depth and median, Co-evolution of density and topology in a simple model of city formation, Classification using proximity catch digraphs, Odd Yao-Yao Graphs are Not Spanners, The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association, The relative neighborhood graph for mixed feature variables, Comparison of Proximity Measures for a Topological Discrimination, A new family of random graphs for testing spatial segregation, Further nonparametric tests for comparing dissimilarity matrices based on the relative neighborhood graph, New sequential and parallel algorithms for computing the \(\beta\)-spectrum, Not all insertion methods yield constant approximate tours in the Euclidean plane, Finding the minimum vertex distance between two disjoint convex polygons in linear time, 10-Gabriel graphs are Hamiltonian, The approximate rectangle of influence drawability problem
Cites Work
- Divide and conquer for linear expected time
- Parallel concepts in graph theory
- An Alternative Definition for "Neighborhood of a Point"
- Computing Dirichlet Tessellations in the Plane
- Triangulation of planar regions with applications
- Random minimal trees
- Random Minimal Trees
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
