Pages that link to "Item:Q644800"
From MaRDI portal
The following pages link to Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800):
Displaying 12 items.
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Preclustering algorithms for imprecise points (Q2144264) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- (Q5075809) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5896889) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5918556) (← links)
- On algorithmic complexity of imprecise spanners (Q6071451) (← links)
- An algorithmic framework for the single source shortest path problem with applications to disk graphs (Q6101843) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
