Pages that link to "Item:Q1141155"

The following pages link to The relative neighbourhood graph of a finite planar set (Q1141155):

Displaying 50 items.

• Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family (Q82973) (← links)
• Swarm intelligence for self-organized clustering (Q86925) (← links)
• Parsimonious Hidden Markov Models for Matrix-Variate Longitudinal Data (Q118176) (← links)
• A strong law of large numbers for random biased connected graphs (Q395092) (← links)
• Comparison of relative density of two random geometric digraph families in testing spatial clustering (Q464444) (← links)
• A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles (Q635380) (← links)
• Edge density of new graph types based on a random digraph family (Q670163) (← links)
• Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993) (← links)
• Closed rectangle-of-influence drawings for irreducible triangulations (Q709065) (← links)
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
• An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces (Q757098) (← links)
• Classification using proximity catch digraphs (Q782440) (← links)
• A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
• Coloring certain proximity graphs (Q917569) (← links)
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association (Q959283) (← links)
• Extension of one-dimensional proximity regions to higher dimensions (Q991185) (← links)
• Semantic fusion of laser and vision in pedestrian detection (Q991997) (← links)
• Co-evolution of density and topology in a simple model of city formation (Q1035741) (← links)
• The relative neighborhood graph for mixed feature variables (Q1057662) (← links)
• Further nonparametric tests for comparing dissimilarity matrices based on the relative neighborhood graph (Q1063975) (← links)
• Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
• Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
• The expected size of some graphs in computational geometry (Q1106021) (← links)
• A linear expected-time algorithm for computing planar relative neighbourhood graphs (Q1108002) (← links)
• Optimization of the movements of a component placement machine (Q1111924) (← links)
• A simple linear-time algorithm for computing the ring and MST of unimodal polygons (Q1120279) (← links)
• Graph theoretical clustering based on limited neighbourhood sets (Q1163319) (← links)
• Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space (Q1175789) (← links)
• The \(\gamma\)-neighborhood graph (Q1194312) (← links)
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
• Relative neighborhood graphs in three dimensions (Q1200909) (← links)
• Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
• Constructing competitive tours from local information (Q1331954) (← links)
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation (Q1334610) (← links)
• Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
• Partial dissimilarities with application to clustering (Q1344863) (← links)
• A survey of constrained classification (Q1351841) (← links)
• Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\) (Q1373781) (← links)
• The rectangle of influence drawability problem (Q1388129) (← links)
• Intersections with random geometric objects (Q1392845) (← links)
• Classification by restricted random walks (Q1402697) (← links)
• Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis (Q1740109) (← links)
• Proximity drawings in polynomial area and volume (Q1882852) (← links)
• Characterizing proximity trees (Q1920422) (← links)
• Affine invariant triangulations (Q2065637) (← links)
• Tuned communicability metrics in networks. The case of alternative routes for urban traffic (Q2201378) (← links)