The following pages link to (Q5501287):
Displaying 11 items.
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Toward the fast blind docking of a peptide to a target protein by using a four-body statistical pseudo-potential (Q1631157) (← links)
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL (Q2371333) (← links)
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) (Q2415360) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- Algorithm 1012 (Q5066585) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- Approximating Largest Convex Hulls for Imprecise Points (Q5443375) (← links)