Euclidean minimum spanning trees with independent and dependent geometric uncertainties

DOI10.1016/j.comgeo.2020.101744OpenAlexW3120827975WikidataQ114195546 ScholiaQ114195546MaRDI QIDQ1984604

Or Bartal, Leo Joskowicz, Rivka Gitik

Publication date: 16 September 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101744

zbMATH Keywords

Euclidean minimum spanning treedependent and independent geometric uncertaintyuncertain point location

Mathematics Subject Classification ID

Discrete geometry (52Cxx) Computing methodologies and applications (68Uxx)

Related Items (2)

Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest and smallest convex hulls for imprecise points
• Minimum spanning trees in networks with varying edge weights
• Stable Delaunay graphs
• Applications of second-order cone programming
• Constructing strongly convex hulls using exact or rounded arithmetic
• Computing convex hull in a floating point arithmetic
• On the complexity of the robust spanning tree problem with interval data
• Approximating quadratic programming with bound and quadratic constraints
• Structural tolerance and Delaunay triangulation
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
• Largest bounding box, smallest diameter, and related problems on imprecise points
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• On minimum- and maximum-weight minimum spanning trees with neighborhoods
• Constructing strongly convex approximate hulls with inaccurate primitives
• Convex hulls under uncertainty
• THE STABILITY OF DELAUNAY TRIANGULATIONS
• A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
• Closest Pair and the Post Office Problem for Stochastic Points
• POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
• Stochastic minimum spanning trees in euclidean spaces
• Kinetic stable Delaunay graphs
• Minimum Spanning Tree with Neighborhoods
• An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
• The robust spanning tree problem with interval data

This page was built for publication: Euclidean minimum spanning trees with independent and dependent geometric uncertainties