Largest and smallest convex hulls for imprecise points
From MaRDI portal
Publication:848964
DOI10.1007/s00453-008-9174-2zbMath1185.65036OpenAlexW2105946172MaRDI QIDQ848964
Maarten Löffler, Marc J. van Kreveld
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9174-2
Related Items (39)
On the separability of stochastic geometric objects, with applications ⋮ Separability of imprecise points ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Preclustering algorithms for imprecise points ⋮ POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES ⋮ Computing the Expected Value and Variance of Geometric Measures ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Minimum color spanning circle of imprecise points ⋮ Connectivity graphs of uncertainty regions ⋮ Largest area convex hull of imprecise data based on axis-aligned squares ⋮ Color spanning objects: algorithms and hardness results ⋮ Closest pair and the post office problem for stochastic points ⋮ Convex transversals ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ On hub location problems in geographically flexible networks ⋮ On algorithmic complexity of imprecise spanners ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties ⋮ Largest convex hulls for constant size, convex-hull disjoint clusters ⋮ Secure multi-party convex hull protocol based on quantum homomorphic encryption ⋮ Large \(k\)-gons in a 1.5D terrain ⋮ Minimum-perimeter intersecting polygons ⋮ Covering points with convex sets of minimum size ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Unnamed Item ⋮ New results on stabbing segments with a polygon ⋮ Largest and smallest area triangles on imprecise points ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Data imprecision under \(\lambda\)-geometry model ⋮ 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 Analysis ⋮ The maximal distance between imprecise point objects ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Approximating largest convex hulls for imprecise points ⋮ Covering Points with Convex Sets of Minimum Size ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Minimizing Co-location Potential of Moving Entities ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ The linear fuzzy space: theory and applications ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model ⋮ On minimum- and maximum-weight minimum spanning trees with neighborhoods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness of numerical methods in geometric computation when problem data is uncertain
- Finding transversals for sets of simple geometric figures
- The algebraic degree of geometric optimization problems
- Constructing strongly convex hulls using exact or rounded arithmetic
- Structural tolerance and Delaunay triangulation
- Systems of distant representatives
- Constructing strongly convex approximate hulls with inaccurate primitives
- On intersecting a set of parallel line segments with a convex polygon of minimum area
- Touring a sequence of polygons
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- The Complexity of Computing Steiner Minimal Trees
- Computing Visibility Information in an Inaccurate Simple Polygon
- Computing the Angularity Tolerance
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- Precision-Sensitive Euclidean Shortest Path in 3-Space
- Stabbing parallel segments with a convex polygon
- Approximating Largest Convex Hulls for Imprecise Points
- TSP with neighborhoods of varying size
- Algorithms - ESA 2003
This page was built for publication: Largest and smallest convex hulls for imprecise points
