References
- Abou Tabl, A., A. Alkhateeb, and W. ElMaraghy. 2021. “Deep Learning Method Based on Big Data for Defects Detection in Manufacturing Systems Industry 4.0.” International Journal of Industry and Sustainable Development 2 (1): 1–14. doi:https://doi.org/10.21608/ijisd.2021.145552.
- Abu-Qasmieh, I., and H. Al-Quran. 2018. “Unrestricted LR Detection for Biomedical Applications Using Coarse-to-Fine Hierarchical Approach.” IET Image Processing 12 (9): 1639–1645. doi:https://doi.org/10.1049/iet-ipr.2017.0509.
- Atallah, M. J., and G. N. Frederickson. 1986. “A Note on Finding A Maximum Empty Rectangle.” Discrete Applied Mathematics 13 (1): 87–91. doi:https://doi.org/10.1016/0166-218X(86)90071-5.
- Cabello, S., O. Cheong, C. Knauer, and L. Schlipf. 2014. “Finding Largest Rectangles in Convex Polygons.” Computational Geometry: Theory and Applications 51: 67–74. doi:https://doi.org/10.1016/j.comgeo.2015.08.001.
- Canny, J. 1986. “A Computational Approach to Edge Detection.” IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-8 (6): 679–698. doi:https://doi.org/10.1109/TPAMI.1986.4767851.
- Chazelle, B., R. L. Drysdale, and D. T. Lee. 1986. “Computing the Largest Empty Rectangle.” SIAM Journal on Computing 15 (1): 300–315. doi:https://doi.org/10.1137/0215022.
- Cheng, C. C., and J. S. Tsai. 2004. “Global Cutting for the Maximum Rectangular Block from Arbitrary Closed Region.” International Journal of Machine Tools & Manufacture 44 (14): 1423–1430. doi:https://doi.org/10.1016/j.ijmachtools.2004.06.009.
- Daniels, K., V. Milenkovic, and D. Roth. 1997. “Finding the Largest Area Axis-Parallel Rectangle in a Polygon.” Computational Geometry: Theory and Applications 7 (1–2): 125–148. doi:https://doi.org/10.1016/0925-7721(95)00041-0.
- Datta, A., R. Srikant, G. D. S. Ramkumar, and K. Krithivasan. 1992. “Fast Parallel Algorithms for the Maximum Empty Rectangle Problem.” Sadhana 17 (1): 221–236. doi:https://doi.org/10.1007/BF02811344.
- De, M., A. Maheshwari, S. C. Nandy, and M. Smid. 2013. “An In-Place Min-Max Priority Search Tree.” Computational Geometry: Theory and Applications 46 (3): 310–327. doi:https://doi.org/10.1016/j.comgeo.2012.09.007.
- Fischer, P., and K. U. Höffgen. 1994. “Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon.” Information Processing Letters 51 (4): 189–193. doi:https://doi.org/10.1016/0020-0190(94)00079-4.
- Gonzalez, R. C., and R. E. Woods. 2007. Digital Image Processing. New Jersey: Pearson.
- Jung, C. R., and R. Schramm. 2004. “Rectangle Detection Based on a Windowed Hough Transform.” Proceedings of the XVII Brazilian Symposium on Computer Graphics and Image Processing, Curitiba, Brazil, 113–120.
- Knauer, C., L. Schlipf, J. M. Schmidt, and H. R. Tiwary. 2012. “Largest Inscribed Rectangles in Convex Polygons.” Journal of Discrete Algorithms 13: 78–85. doi:https://doi.org/10.1016/j.jda.2012.01.002.
- Lara, F., G. Gutiérrez, M. A. Soto, and A. Corral. 2017. “Queries about the Largest Empty Rectangle in Large 2-Dimensional Datasets Stored in Secondary Memory.” Ingenieria E Investigacion 37 (3): 133–140. doi:https://doi.org/10.15446/ing.investig.v37n3.60339.
- Mannila, H., and D. Wood. 1988. “A Note on the Largest Empty Rectangle Problem.” BIT 28 (1): 179–183. doi:https://doi.org/10.1007/BF01934704.
- Molano, R., P. G. Rodríguez, A. Caro, and M. L. Durán. 2012. “Finding the Largest Area Rectangle of Arbitrary Orientation in a Closed Contour.” Applied Mathematics and Computation 218 (19): 9866–9874. doi:https://doi.org/10.1016/j.amc.2012.03.063.
- Mukhopadhyay, A., and S. V. Rao. 2003. “On Computing a Largest Empty Arbitrarily Oriented Rectangle.” International Journal of Computational Geometry & Applications 13 (3): 257–271. doi:https://doi.org/10.1142/S0218195903001153.
- Naamad, A., D. T. Lee, and W. L. Hsu. 1984. “On the Maximum Empty Rectangle Problem.” Discrete Applied Mathematics 8 (3): 267–277. doi:https://doi.org/10.1016/0166-218X(84)90124-0.
- Orlowski, M. 1990. “A New Algorithm for the Largest Empty Rectangle Problem.” Algorithmica 5 (1–4): 65–73. doi:https://doi.org/10.1007/BF01840377.
- Otsu, N. 1979. “A Threshold Selection Method from Gray-Level Histograms.” IEEE Transactions on Systems, Man, and Cybernetics 9 (1): 62–66. doi:https://doi.org/10.1109/TSMC.1979.4310076.
- Park, J. K., H. S. Jeon, M. C. Ko, and S. H. Noh. 2013. “R-Map: A Hybrid Map for Mobile Robot in Ubiquitous Computing Environment.” Information (Japan) 16 (4): 2599–2606.
- Sarkar, A., A. Biswas, M. Dutt, and A. Bhattacharya. 2018. “Finding a Largest Rectangle inside a Digital Object and Rectangularization.” Journal of Computer and System Sciences 95: 204–217. doi:https://doi.org/10.1016/j.jcss.2017.05.006.
- Stavropoulos, P., A. Papacharalampopoulos, and D. Petridis. 2020. “A Vision-Based System for Real-Time Defect Detection: A Rubber Compound Part Case Study.” Procedia CIRP 93: 1230–1235. doi:https://doi.org/10.1016/j.procir.2020.04.159.
- Sturm, J., K. Konolige, C. Stachniss, and W. Burgard. 2010. “Vision-Based Detection for Learning Articulation Models of Cabinet Doors and Drawers in Household Environments.” Proceedings of the 2010 IEEE International Conference on Robotics and Automation, Anchorage, AK, USA, 362–368.
- Suzuki, S., and K. Abe. 1985. “Topological Structural Analysis of Digitized Binary Images by Border Following.” Computer Vision, Graphics, and Image Processing 30 (1): 32–46. doi:https://doi.org/10.1016/0734-189X(85)90016-7.
- Xie, X. H., D. Liang, X. Q. Zhang, D. Y. Zhang, and J. J. Zhou. 2015. “Detecting Maximum Inscribed Rectangle Area of Target Object Based on Image Processing.” Science Technology and Engineering 15 (17): 193–197.
- Yuan, Z., Y. Z. Wang, H. T. Shi, J. Y. Xiao, and L. Y. Wang. 2016. “Solution of Graphics Maximum Enclosed Rectangle Based on Improved Genetic Algorithm.” Control Engineering of China 23 (3): 400–404. doi:https://doi.org/10.14107/j.cnki.kzgc.140368.