Largest and smallest area triangles on imprecise points

DOI10.1016/J.COMGEO.2020.101742MaRDI QIDQ1984599zbMATH OpenOpenAlexFDO

Authors Vahideh Keikha, Maarten Löffler, Ali Mohades

Publication date 16 September 2021

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.08911

zbMATH Keywords

\(k\)-goncomputational geometrymaximum area triangle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Largest and smallest convex hulls for imprecise points
• Largest triangles in a polygon
• Approximating largest convex hulls for imprecise points
• Approximating Largest Convex Hulls for Imprecise Points
• Largest and Smallest Tours and Convex Hulls for Imprecise Points

Cites work

• A note on lower bounds for the maximum area and maximum perimeter k-gon problems
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• All-maximum and all-minimum problems under some measures
• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Convex partial transversals of planar regions
• Convex transversals
• Covering and piercing disks with two centers
• Finding Extremal Polygons
• Finding k points with minimum diameter and related problems
• Finding minimum area \(k\)-gons
• Finding sets of points without empty convex 6-gons
• Finding transversals for sets of simple geometric figures
• Geometric applications of a matrix-searching algorithm
• Geometric Computations on Indecisive Points
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1786519 (Why is no real title available?)
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• Largest and smallest convex hulls for imprecise points
• Largest area convex hull of imprecise data based on axis-aligned squares
• Largest bounding box, smallest diameter, and related problems on imprecise points
• More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems
• New results on stabbing segments with a polygon
• NP-Completeness of Spreading Colored Points
• On the all-farthest-segments problem for a planar set of points
• On the convex layers of a planar set
• On the Most Likely Convex Hull of Uncertain Points
• Proximity problems on line segments spanned by points
• Searching for empty convex polygons
• Separability of imprecise points
• Simultaneous inner and outer approximation of shapes
• SMOOTHING IMPRECISE 1.5D TERRAINS
• Stabbing parallel segments with a convex polygon
• Topologically sweeping an arrangement

Cited in

(4)

• Continuous location problems and big triangle small triangle: Constructing better bounds
• Minimum color spanning circle of imprecise points
• Largest triangle inside a terrain
• Clustering geometrically-modeled points in the aggregated uncertainty model

This page was built for publication: Largest and smallest area triangles on imprecise points

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