New sequential and parallel algorithms for computing the -spectrum
From MaRDI portal
Publication:2348036
Recommendations
Cites work
- A divide-and-conquer algorithm for constructing relative neighborhood graph
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
- Beta-skeletons have unbounded dilation
- Optimal parallel algorithms for point-set and polygon problems
- Parallel computational geometry
- Ray shooting in polygons using geodesic triangulations
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- The relative neighbourhood graph of a finite planar set
- Time-optimal proximity graph computations on enhanced meshes
- Ultrafast Expected Time Parallel Algorithms
Cited in
(4)
This page was built for publication: New sequential and parallel algorithms for computing the \(\beta\)-spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348036)