Optimal and suboptimal robust algorithms for proximity graphs
From MaRDI portal
Recommendations
Cites work
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
- Efficient algorithms for line and curve segment intersection using restricted predicates
- On the shape of a set of points in the plane
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Reporting curve segment intersections using restricted predicates
- Robust Plane Sweep for Intersecting Segments
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- The \(\gamma\)-neighborhood graph
- Topologically sweeping an arrangement
Cited in
(9)- scientific article; zbMATH DE number 2086250 (Why is no real title available?)
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- A low arithmetic-degree algorithm for computing proximity graphs
- Essential constraints of edge-constrained proximity graphs
- \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\)
- Algorithms for computing the optimal transitive approximation of a proximity relation
- New sequential and parallel algorithms for computing the \(\beta\)-spectrum
- Output-sensitive algorithm for computing \(\beta\)-skeletons
- scientific article; zbMATH DE number 1830717 (Why is no real title available?)
This page was built for publication: Optimal and suboptimal robust algorithms for proximity graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873154)