Base-object location problems for base-monotone regions
DOI10.1016/J.TCS.2013.11.030zbMATH Open1360.68871OpenAlexW1967209207MaRDI QIDQ744059FDOQ744059
Authors: Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno 
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
Recommendations
- Base Location Problems for Base-Monotone Regions
- On maximum weight objects decomposable into based rectilinear convex objects
- EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
- scientific article; zbMATH DE number 871905
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Efficient graph-based image segmentation
- An \(O(n ^{3} \log\log n/\log ^{2} n)\) time algorithm for all pairs shortest paths
- Efficient bounds for the stable set, vertex cover and set packing problems
- Compact visibility representation of plane graphs
- 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
Cited In (2)
This page was built for publication: Base-object location problems for base-monotone regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744059)
