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: Comput. Geom. (2015)
Keyphrases
- upper bound
- weighted graph
- randomly distributed
- maximum number
- lower bound
- point sets
- edge detection
- delaunay triangulation
- edge information
- surface reconstruction
- undirected graph
- graph structure
- minimum spanning trees
- worst case
- bayesian networks
- vertex set
- feature points
- small world
- alternative formulations
- sample points
- upper and lower bounds
- graph mining
- endpoints
- uncertain data
- point cloud
- np hard