Largest and Smallest Tours and Convex Hulls for Imprecise Points
From MaRDI portal
Publication:5757883
Recommendations
- Largest and smallest convex hulls for imprecise points
- Approximating Largest Convex Hulls for Imprecise Points
- Approximating largest convex hulls for imprecise points
- Existence and computation of tours through imprecise points
- Largest bounding box, smallest diameter, and related problems on imprecise points
Cited in
(15)- Approximating Largest Convex Hulls for Imprecise Points
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- Minimum perimeter convex hull of imprecise points in convex regions
- Existence and computation of tours through imprecise points
- Largest and smallest area triangles on imprecise points
- Triangulating input-constrained planar point sets
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
- Approximating largest convex hulls for imprecise points
- Computing the Fréchet distance between uncertain curves in one dimension
- Expected computations on color spanning sets
- Query-competitive algorithms for cheapest set problems under uncertainty
- Largest and smallest convex hulls for imprecise points
- Computing the Fréchet distance between uncertain curves in one dimension
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Fréchet Distance for Uncertain Curves
This page was built for publication: Largest and Smallest Tours and Convex Hulls for Imprecise Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757883)