Euclidean minimum spanning trees with independent and dependent geometric uncertainties
type: Item
instance of: scholarly article
title: Euclidean minimum spanning trees with independent and dependent geometric uncertainties
author: Rivka Gitik
author: Or Bartal
author: Leo Joskowicz
published in: Computational Geometry
publication date: 2021-09-16T00:00:00Z
Mathematics Subject Classification ID: 68Uxx
Mathematics Subject Classification ID: 52Cxx
zbMATH DE Number: 7396282
zbMATH Keywords: Euclidean minimum spanning tree
zbMATH Keywords: uncertain point location
zbMATH Keywords: dependent and independent geometric uncertainty
MaRDI profile type: Publication
full work available at URL: j.comgeo.2020.101744
OpenAlex ID: W3120827975
Wikidata QID: Q114195546
cites work: Structural tolerance and Delaunay triangulation
cites work: Kinetic stable Delaunay graphs
cites work: Stable Delaunay graphs
cites work: Convex hulls under uncertainty
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
cites work: Q3182207
cites work: The stability of Delaunay triangulations
cites work: On minimum- and maximum-weight minimum spanning trees with neighborhoods
cites work: Q4326414
cites work: Q3132872
cites work: Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
cites work: Constructing strongly convex approximate hulls with inaccurate primitives
cites work: An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
cites work: Minimum spanning trees in networks with varying edge weights
cites work: Computing convex hull in a floating point arithmetic
cites work: Closest Pair and the Post Office Problem for Stochastic Points
cites work: Stochastic minimum spanning trees in euclidean spaces
cites work: Constructing strongly convex hulls using exact or rounded arithmetic
cites work: Applications of second-order cone programming
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: A compact piecewise-linear Voronoi diagram for convex sites in the plane
cites work: A framework for algorithm stability and its application to kinetic Euclidean MSTs
cites work: POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
cites work: The robust spanning tree problem with interval data
cites work: Minimum Spanning Tree with Neighborhoods
cites work: Approximating quadratic programming with bound and quadratic constraints
DOI: 10.1016/J.COMGEO.2020.101744
description: scientific article; zbMATH DE number 7396282