Sigma-local graphs
From MaRDI portal
Publication:2266933
DOI10.1016/J.JDA.2008.10.002zbMATH Open1214.05090OpenAlexW2107640410MaRDI QIDQ2266933FDOQ2266933
Authors: Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel Smid 
Publication date: 26 February 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.10.002
Recommendations
Cites Work
- On nearest-neighbor graphs
- Algorithms for Reporting and Counting Geometric Intersections
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Title not available (Why is that?)
- Classes of graphs which approximate the complete Euclidean graph
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- An O(n log n) algorithm for the all-nearest-neighbors problem
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Fast detection of polyhedral intersection
- Empty region graphs
- The relative neighborhood graph for mixed feature variables
- Local polyhedra and geometric graphs
- The \(\gamma\)-neighborhood graph
- Relative neighborhood graphs in three dimensions
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- A time-optimal parallel algorithm for three-dimensional convex hulls
Cited In (3)
This page was built for publication: Sigma-local graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266933)
