Largest and smallest convex hulls for imprecise points
From MaRDI portal
Publication:848964
DOI10.1007/S00453-008-9174-2zbMATH Open1185.65036OpenAlexW2105946172MaRDI QIDQ848964FDOQ848964
Authors: Maarten Löffler, Marc 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
Recommendations
- Largest and Smallest Tours and Convex Hulls for Imprecise Points
- Approximating Largest Convex Hulls for Imprecise Points
- Approximating largest convex hulls for imprecise points
- Largest area convex hull of axis-aligned squares based on imprecise data
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
Cites Work
- The algebraic degree of geometric optimization problems
- Constructing strongly convex approximate hulls with inaccurate primitives
- Touring a sequence of polygons
- The Complexity of Computing Steiner Minimal Trees
- Systems of distant representatives
- On intersecting a set of parallel line segments with a convex polygon of minimum area
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- TSP with neighborhoods of varying size
- Stabbing parallel segments with a convex polygon
- On the complexity of approximating TSP with neighborhoods and related problems
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- Title not available (Why is that?)
- Structural tolerance and Delaunay triangulation
- Title not available (Why is that?)
- Finding transversals for sets of simple geometric figures
- Robustness of numerical methods in geometric computation when problem data is uncertain
- Constructing strongly convex hulls using exact or rounded arithmetic
- Computing Visibility Information in an Inaccurate Simple Polygon
- Computing the Angularity Tolerance
- Title not available (Why is that?)
- Precision-Sensitive Euclidean Shortest Path in 3-Space
- Approximating Largest Convex Hulls for Imprecise Points
Cited In (48)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Connectivity graphs of uncertainty regions
- The maximal distance between imprecise point objects
- QuickhullDisk: a faster convex hull algorithm for disks
- Approximating Largest Convex Hulls for Imprecise Points
- Title not available (Why is that?)
- Largest bounding box, smallest diameter, and related problems on imprecise points
- On the separability of stochastic geometric objects, with applications
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
- Title not available (Why is that?)
- 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
- On the expected diameter, width, and complexity of a stochastic convex hull
- Large \(k\)-gons in a 1.5D terrain
- Computing the Expected Value and Variance of Geometric Measures
- Preclustering algorithms for imprecise points
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Minimum-perimeter intersecting polygons
- Covering points with convex sets of minimum size
- On the arrangement of stochastic lines in \(\mathbb{R}^2\)
- Largest and Smallest Tours and Convex Hulls for Imprecise Points
- On algorithmic complexity of imprecise spanners
- On the Most Likely Convex Hull of Uncertain Points
- New results on stabbing segments with a polygon
- Minimum color spanning circle of imprecise points
- Existence and computation of tours through imprecise points
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- Minimizing co-location potential of moving entities
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- On hub location problems in geographically flexible networks
- Color spanning objects: algorithms and hardness results
- Approximating largest convex hulls for imprecise points
- Covering Points with Convex Sets of Minimum Size
- Secure multi-party convex hull protocol based on quantum homomorphic encryption
- Largest and smallest area triangles on imprecise points
- Half-plane point retrieval queries with independent and dependent geometric uncertainties
- Largest convex hulls for constant size, convex-hull disjoint clusters
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Separability of imprecise points
- The linear fuzzy space: theory and applications
- Largest area convex hull of axis-aligned squares based on imprecise data
- Minimizing the diameter of a spanning tree for imprecise points
- Computing largest minimum color-spanning intervals of imprecise points
- POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
- Largest area convex hull of imprecise data based on axis-aligned squares
- Data imprecision under \(\lambda\)-geometry model
- Closest pair and the post office problem for stochastic points
- Convex transversals
This page was built for publication: Largest and smallest convex hulls for imprecise points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848964)
