Largest and smallest area triangles on imprecise points
type: Item
instance of: scholarly article
title: Largest and smallest area triangles on imprecise points
author: Vahideh Keikha
author: Maarten Löffler
author: Ali Mohades
published in: Computational Geometry
publication date: 2021-09-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1712.08911
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7396279
zbMATH Keywords: computational geometry
zbMATH Keywords: maximum area triangle
zbMATH Keywords: \(k\)-gon
MaRDI profile type: Publication
OpenAlex ID: W2950932422
cites work: Convex hulls under uncertainty
cites work: Finding k points with minimum diameter and related problems
cites work: Geometric applications of a matrix-searching algorithm
cites work: Covering and piercing disks with two centers
cites work: Convex transversals
cites work: Finding Extremal Polygons
cites work: Q4607939
cites work: A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
cites work: On the convex layers of a planar set
cites work: NP-Completeness of Spreading Colored Points
cites work: Proximity problems on line segments spanned by points
cites work: New results on stabbing segments with a polygon
cites work: Searching for empty convex polygons
cites work: A note on lower bounds for the maximum area and maximum perimeter k-gon problems
cites work: An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
cites work: Finding transversals for sets of simple geometric figures
cites work: Topologically sweeping an arrangement
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: Q4763392
cites work: Finding minimum area \(k\)-gons
cites work: Simultaneous inner and outer approximation of shapes
cites work: Stabbing parallel segments with a convex polygon
cites work: SMOOTHING IMPRECISE 1.5D TERRAINS
cites work: Geometric Computations on Indecisive Points
cites work: Largest area convex hull of imprecise data based on axis-aligned squares
cites work: Convex partial transversals of planar regions
cites work: Largest and smallest convex hulls for imprecise points
cites work: Largest bounding box, smallest diameter, and related problems on imprecise points
cites work: On the all-farthest-segments problem for a planar set of points
cites work: All-maximum and all-minimum problems under some measures
cites work: Q4547814
cites work: Finding sets of points without empty convex 6-gons
cites work: Q3992847
cites work: Separability of imprecise points
cites work: On the Most Likely Convex Hull of Uncertain Points
DOI: 10.1016/J.COMGEO.2020.101742
description: scientific article; zbMATH DE number 7396279