Output-Sensitive Algorithm for Computing β-Skeletons
Copyright policy )Output-Sensitive Algorithm for Computing β-Skeletons
A \(\beta\)-skeleton of a planar set of \(n\) points, i.e. the geometric graph obtained by joining the pair of points whose \(\beta\)-neighborhood is empty, can be computed by a standard algorithm in time \(O(n^{5/2}\log n)\). An algorithm is proposed to detect the \(\beta\)-skeleton in time \(O(n\log n+k)\), where \(k\) is the size of the output graph. After the algorithm description, it is proved a theorem concerning the space and time necessary to perform the algorithm.
- University of Windsor Canada
Complexity and performance of numerical algorithms, \(\beta\)-skeleton, Numerical aspects of computer graphics, image analysis, and computational geometry, computational geometry, planar set of points, algorithms, performance
Complexity and performance of numerical algorithms, \(\beta\)-skeleton, Numerical aspects of computer graphics, image analysis, and computational geometry, computational geometry, planar set of points, algorithms, performance
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!