Performing Multicut on Walkable Environments

DOI10.1007/978-3-319-48749-6_23MaRDI QIDQ2958325zbMATH OpenOpenAlexFDO

Authors Arne Hillebrand, Marjan Van Den Akker, Roland Geraerts, Han Hoogeveen

Publication date 1 February 2017

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-48749-6_23

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Shortest-Path Constraints for 3D Multiobject Semiautomatic Segmentation Via Clustering and Graph Cut
• Geometric multicut: shortest fences for separating groups of objects in the plane
• Rapid and effective segmentation of 3D models using random walks
• Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
• Combination of piecewise-geodesic paths for interactive segmentation
• Minimum planar multi-sink cuts with connectivity priors
• 3D shape segmentation using multiple random walkers

Cites work

• scientific article; zbMATH DE number 1187148 (Why is no real title available?)
• An algorithm for straight-line drawing of planar graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Performing Multicut on Walkable Environments
• SOFSEM 2006: Theory and Practice of Computer Science
• The Complexity of Multiterminal Cuts
• Two-Commodity Flow

Cited in

(1)

• Performing Multicut on Walkable Environments

This page was built for publication: Performing Multicut on Walkable Environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958325)