Approximating largest convex hulls for imprecise points

DOI10.1016/J.JDA.2008.04.002zbMATH Open1154.68544OpenAlexW2026291033MaRDI QIDQ1002103FDOQ1002103

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

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
• Publication:4504027
• Largest area convex hull of axis-aligned squares based on imprecise data

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)

Cites Work

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

Cited In (18)

• Title not available (Why is that?)
• 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 power of the semi-separated pair decomposition
• Title not available (Why is that?)
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Convex hulls under uncertainty
• Minimum-perimeter intersecting polygons
• Largest and Smallest Tours and Convex Hulls for Imprecise Points
• On the Most Likely Convex Hull of Uncertain Points
• The directed Hausdorff distance between imprecise point sets
• New results on stabbing segments with a polygon
• Minimum color spanning circle of 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
• On the Power of the Semi-Separated Pair Decomposition
• Visibility testing and counting for uncertain segments

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)