Base-object location problems for base-monotone regions

DOI10.1016/j.tcs.2013.11.030zbMath1360.68871OpenAlexW1967209207MaRDI QIDQ744059

Takashi Horiyama, Yota Otachi, Takehiro Ito, Ryuhei Uehara, Takeshi Tokuyama, Natsuda Kaothanthong, Jinhee Chun, Takeaki Uno, Hirotaka Ono

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.030

zbMATH Keywords

computational complexityimage segmentationbase-monotone regionroom-edge problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient bounds for the stable set, vertex cover and set packing problems
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Some simplified NP-complete graph problems
• Efficient graph-based image segmentation
• An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
• Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION