Approximating largest convex hulls for imprecise points

DOI10.1016/J.JDA.2008.04.002MaRDI QIDQ1002103zbMATH OpenOpenAlexFDO

Authors Maarten Löffler, Marc Van Kreveld

Publication date 23 February 2009

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2008.04.002

zbMATH Keywords

computational geometryconvex hulldata imprecisioncore-sets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Approximating Largest Convex Hulls for Imprecise Points
• Largest and smallest convex hulls for imprecise points
• Largest and Smallest Tours and Convex Hulls for Imprecise Points
• scientific article; zbMATH DE number 1507301
• Largest area convex hull of axis-aligned squares based on imprecise data

Cites work

• scientific article; zbMATH DE number 5506202 (Why is no real title available?)
• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Almost-Delaunay simplices, nearest neighbor relations for imprecise points
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• Analysis of incomplete data and an intrinsic-dimension Helly theorem
• Constructing strongly convex approximate hulls with inaccurate primitives
• Constructing strongly convex hulls using exact or rounded arithmetic
• Largest and smallest convex hulls for imprecise points
• Maintaining approximate extent measures of moving points
• Robustness of numerical methods in geometric computation when problem data is uncertain
• Structural tolerance and Delaunay triangulation
• Systems of distant representatives

Cited in

(28)

• Largest and smallest convex hulls for imprecise points
• scientific article; zbMATH DE number 1755731 (Why is no real title available?)
• Inner -approximation of the convex hull of finite sets
• The directed Hausdorff distance between imprecise point sets
• Computing smallest convex intersecting polygons
• Approximating Largest Convex Hulls for Imprecise Points
• scientific article; zbMATH DE number 1670646 (Why is no real title available?)
• Largest bounding box, smallest diameter, and related problems on imprecise points
• On the power of the semi-separated pair decomposition
• scientific article; zbMATH DE number 1507301 (Why is no real title available?)
• Minimum perimeter convex hull of imprecise points in convex regions
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Minimum-perimeter intersecting polygons
• Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares
• On the Most Likely Convex Hull of Uncertain Points
• Largest and Smallest Tours and Convex Hulls for Imprecise Points
• New results on stabbing segments with a polygon
• The directed Hausdorff distance between imprecise point sets
• 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
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
• Verification problem of maximal points under uncertainty
• On the Power of the Semi-Separated Pair Decomposition
• Largest and smallest area triangles on imprecise points
• Visibility testing and counting for uncertain segments
• Largest area convex hull of axis-aligned squares based on imprecise data
• Largest area convex hull of imprecise data based on axis-aligned squares

This page was built for publication: Approximating largest convex hulls for imprecise points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002103)