An optimal algorithm for extracting the regions of a plane graph

DOI10.1016/0167-8655(93)90104-LMaRDI QIDQ4274664zbMATH OpenFDO

Authors Xiaoyi Jiang, Horst Bunke

Publication date 2 January 1994

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(93)90104-L

zbMATH Keywords

plane graphpolyhedraregionssurfaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 975400
• An optimal parallel algorithm for planar cycle separators
• scientific article; zbMATH DE number 4060742
• Optimal parallel algorithms on planar graphs
• A linear algorithm for the maximal planar subgraph problem

Cited in

(4)

• Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
• Optimal enclosing regions in planar graphs
• Mend the gap: a smart repair algorithm for noisy polygonal tilings

This page was built for publication: An optimal algorithm for extracting the regions of a plane graph

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