On maximum flows in polyhedral domains

DOI10.1016/0022-0000(90)90020-LzbMath0705.68064OpenAlexW2092529578MaRDI QIDQ918212

Joseph S. B. Mitchell

Publication date: 1990

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(90)90020-l

zbMATH Keywords

shortest paths problemscomputation of maximum flows

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Polyhedral manifolds (52B70)

Related Items (3)

Minimum shared‐power edge cut ⋮ Routing multi-class traffic flows in the plane ⋮ Maximum thick paths in static and dynamic environments

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• An algorithm for shortest-path motion in three dimensions
• Visibility of disjoint polygons
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• Optimal shortest path queries in a simple polygon
• A data structure for dynamic trees
• The Discrete Geodesic Problem
• Maximal Flow Through a Network
• Maximal flow through a domain
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A new approach to the maximum-flow problem
• Maximum Flow in Planar Networks
• Medial Axis Transformation of a Planar Shape
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: On maximum flows in polyhedral domains