Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
Esther M. ArkinAntonio Fernández AntaJoseph S. B. MitchellMiguel A. MosteiroPublished in: CCCG (2011)
Keyphrases
- upper bound
- weighted graph
- randomly distributed
- maximum number
- undirected graph
- point sets
- lower bound
- probabilistic model
- delaunay triangulation
- upper and lower bounds
- graph theoretic
- endpoints
- bayesian networks
- edge points
- graph structure
- surface reconstruction
- graph matching
- generative model
- edge detection
- uncertain data
- worst case
- sampled data
- minimum spanning trees
- sample points
- rate distortion theory
- alternative formulations
- edge weights
- lower and upper bounds
- graph databases
- graph mining
- directed graph
- feature points
- data points
- multiscale