Largest and smallest area triangles on imprecise points

DOI10.1016/j.comgeo.2020.101742OpenAlexW2950932422MaRDI QIDQ1984599

Maarten Löffler, Ali Mohades, Vahideh Keikha

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

computational geometry\(k\)-gonmaximum area triangle

Mathematics Subject Classification ID

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

Related Items (2)

Minimum color spanning circle of imprecise points ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

Cites Work

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

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