Pages that link to "Item:Q848964"

The following pages link to Largest and smallest convex hulls for imprecise points (Q848964):

Displaying 38 items.

• Largest area convex hull of imprecise data based on axis-aligned squares (Q386441) (← links)
• Closest pair and the post office problem for stochastic points (Q390124) (← links)
• Convex transversals (Q390129) (← links)
• New results on stabbing segments with a polygon (Q474818) (← links)
• Data imprecision under \(\lambda\)-geometry model (Q527138) (← links)
• The maximal distance between imprecise point objects (Q533189) (← links)
• Approximating largest convex hulls for imprecise points (Q1002103) (← links)
• On the separability of stochastic geometric objects, with applications (Q1615884) (← links)
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
• Covering points with convex sets of minimum size (Q1705773) (← 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)
• The linear fuzzy space: theory and applications (Q2086273) (← links)
• Preclustering algorithms for imprecise points (Q2144264) (← links)
• Minimum color spanning circle of imprecise points (Q2166769) (← links)
• Color spanning objects: algorithms and hardness results (Q2181240) (← links)
• QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
• On the expected diameter, width, and complexity of a stochastic convex hull (Q2331212) (← links)
• On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
• Separability of imprecise points (Q2362104) (← links)
• On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
• Connectivity graphs of uncertainty regions (Q2408099) (← links)
• Minimum-perimeter intersecting polygons (Q2429366) (← links)
• Secure multi-party convex hull protocol based on quantum homomorphic encryption (Q2686164) (← links)
• Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
• Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
• Computing the Expected Value and Variance of Geometric Measures (Q4555539) (← links)
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← 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)
• On hub location problems in geographically flexible networks (Q6071054) (← links)
• On algorithmic complexity of imprecise spanners (Q6071451) (← links)
• Half-plane point retrieval queries with independent and dependent geometric uncertainties (Q6110075) (← links)
• Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard (Q6173262) (← links)
• (Q6179335) (← links)
• Computing largest minimum color-spanning intervals of imprecise points (Q6547918) (← links)