Sigma-local graphs

DOI10.1016/j.jda.2008.10.002zbMath1214.05090OpenAlexW2107640410MaRDI QIDQ2266933

Sébastien Collette, Prosenjit Bose, Anil Maheshwari, Stefan Langerman, Pat Morin, Michiel H. M. 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

zbMATH Keywords

geometric graphsproximity graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Fast detection of polyhedral intersection
• Empty region graphs
• The relative neighborhood graph for mixed feature variables
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Classes of graphs which approximate the complete Euclidean graph
• The \(\gamma\)-neighborhood graph
• Relative neighborhood graphs in three dimensions
• On nearest-neighbor graphs
• Local polyhedra and geometric graphs
• A time-optimal parallel algorithm for three-dimensional convex hulls
• Algorithms for Reporting and Counting Geometric Intersections
• On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields

This page was built for publication: Sigma-local graphs