Pages that link to "Item:Q2269143"

The following pages link to Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143):

Displaying 33 items.

• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
• Computing the center of uncertain points on tree networks (Q527423) (← links)
• The directed Hausdorff distance between imprecise point sets (Q553353) (← links)
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
• Cause I'm a genial imprecise point: outlier detection for uncertain data (Q831712) (← links)
• Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
• Largest and smallest area triangles on imprecise points (Q1984599) (← links)
• Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
• Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
• On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
• Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
• Minimum color spanning circle of imprecise points (Q2166769) (← links)
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
• Separability of imprecise points (Q2362104) (← links)
• Connectivity graphs of uncertainty regions (Q2408099) (← links)
• Convex hulls under uncertainty (Q2408916) (← links)
• Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) (Q2415360) (← links)
• Visibility testing and counting for uncertain segments (Q2420576) (← links)
• The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
• Minimum color spanning circle in imprecise setup (Q2695293) (← links)
• Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
• Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
• POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES (Q5300009) (← links)
• Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
• Covering convex polygons by two congruent disks (Q5918557) (← links)
• Covering uncertain points in a tree (Q5920112) (← links)
• Covering convex polygons by two congruent disks (Q5970791) (← links)
• On algorithmic complexity of imprecise spanners (Q6071451) (← links)
• Simple linear time algorithms for piercing pairwise intersecting disks (Q6110069) (← links)
• Half-plane point retrieval queries with independent and dependent geometric uncertainties (Q6110075) (← links)
• Stabbing pairwise intersecting disks by four points (Q6142366) (← links)
• (Q6179335) (← links)