Fast algorithms for computing \(\beta\)-skeletons and their relatives. (Q5948530): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the relative neighborhood graph in 3-dimensional Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time construction of the relative neighborhood graph from the Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\gamma\)-neighborhood graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Euclidean near neighbor searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight euclidean matching and weighted relative neighborhood graphs / rank
 
Normal rank

Latest revision as of 20:12, 3 June 2024

scientific article; zbMATH DE number 1669899
Language Label Description Also known as
English
Fast algorithms for computing \(\beta\)-skeletons and their relatives.
scientific article; zbMATH DE number 1669899

    Statements

    Identifiers