-
1دورية أكاديمية
المؤلفون: Ricardo A. Podestá
المصدر: Revista de Educación Matemática, Vol 37, Iss 1, Pp 31-60 (2022)
مصطلحات موضوعية: embaldosados, polígonos convexos, polígonos regulares, Special aspects of education, LC8-6691, Theory and practice of education, LB5-3640, Mathematics, QA1-939
وصف الملف: electronic resource
العلاقة: https://revistas.unc.edu.ar/index.php/REM/article/view/37469Test; https://doaj.org/toc/0326-8780Test; https://doaj.org/toc/1852-2890Test
-
2رسالة جامعية
المؤلفون: Reis, Paulo Rodrigo Alves dos
المساهمون: Lopes, Andre Von Borries
مصطلحات موضوعية: Números complexos, Polígonos convexos, Fórmula de Heron, Fórmula de Brahmagupta, Fórmula de Bretschneider
وصف الملف: application/pdf
العلاقة: REIS, Paulo Rodrigo Alves dos. Cálculo de áreas de polígonos através de números complexos. 2023. 75 f., il. Dissertação (Mestrado Profissional em Matemática) — Universidade de Brasília, Brasília, 2023.; http://repositorio2.unb.br/jspui/handle/10482/47447Test
-
3رسالة جامعية
المؤلفون: Martínez Contreras, Johana Milena
المساهمون: Alvarez Martínez, David, Pantoja Benavides, Germán Fernando, Amaya Guío, Ciro Alberto, Escobar Falcón, Luis Miguel
مصطلحات موضوعية: Descomposición convexa, Figura poligonal, Polígonos convexos, Algoritmo exacto, Algoritmo aproximado, Empaquetamiento de formas irregulares, Ingeniería
وصف الملف: 34 páginas; application/pdf
العلاقة: Abrahamsen, M. (2021). Covering polygons is even harder. arXiv: Computational Geometry.; Akgun, A., Balcik, C., & Guler, H. (2018). Solving the Two-Dimensional Irregular Shape Packing Problem with a Convex Decomposition Approach. International Conference on Applied Science and Technology (ICAST), (págs. 1-6).; Deng, B., Genova, K., Hinton, G., Yazdani, S., Tagliasacchi, A., & Bouaziz, S. (2020). CvxNet: Learnable Convex Decomposition. IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR).; Falcó, J. (2022). Experimental Mathematics: Manipulative activities to visualize concepts (Vol. 16). Ediciones SM Spain.; Fernández, J., Cánovas, L., & Pelegrin, B. (2000). Algorithms for the decomposition of polygon into convex polygons. European Journal of Operational Research.; Gao, J., Cui, Y., & Huang, D. (2018). Optimal Routing for Autonomous Driving using Minimum Convex Decompositio. IEEE 2018 (IV), (págs. 712-719).; García Collado, F. (s.f.). Polígonos 2D - SDK Multiplataforma en C. Obtenido de NAPPGUI: https://nappgui.com/es/geom2d/pol2d.htmTest; Hedelind, M., & Robertsson, A. (2016). Convex Decomposition in Industrial Robot Applications. IFAC-PapersOnLine, (págs. 60-65).; Hwang, F., & Richards, D. (1992). Steiner tree problems. Networks, 55-89.; Jing, L., Wencheng, W., & Enhua, W. (2007). Point-in-polygon tests by convex decomposition. European Journal of Operational Research.; Keil, M. (1991). Decomposing a polygon into simpler components. Journal of Algorithms, (págs. 71-79).; Leao, A. A., Toledo, F. M., Oliveira, J. F., Carravilla, M. A., & Alvarez-Valdés, R. (2018). Irregular packing problems: A review of mathematical models. Society for Industrial and Applied Mathematics, 15(2), 144-157.; Li, Y., & Zhang, P. (2022). Static hand gesture recognitionbased on hierarchical decisionand classification offinger features. Science Progress.; Li, Z., Gold, C., Zhang, J., Li , J., & Liu, Y. (2014). Minimum Convex Decomposition of 3D Laser Scanned Point Clouds for Building Reconstruction. Sensores (Basilea, Suiza), 19443-19458.; Li, Z., Hu, J., Stojmenovic, M., Liu, Z., & Liu, W. (2020). Revisiting spectral clustering fo rnear-convex decomposition of 2D shape. Pattern Recognition.; Li, Z., Zhang, Z., Lui, H., & Yang, L. (2020). A new path planning method basedon concave polygon convexdecomposition and artificialbee colony algorithm. International Journal of Advanced Robotic Systems.; Lien, J., & Amato, N. (2005). Aproximate convex decomposition of polygons. European Journal of Operational Research.; Lien, J.-M., & Amato, N. M. (2008). Approximate convex decomposition of polygons. Proceedings of the 6th International Symposium on Research Robotics, (págs. 1-11).; López-Camacho, E., Ochoa, G., Terashima-Marín, H., & Burke, E. (2012). An effective heuristic for the two-dimensional irregular bin packing problem. Operational Research, 33(3), 195-202.; Neuenfeldt Júnior, A., Silva, E., Francescatto, M., Brum Rosa, C., & Siluk, J. (2022). The rectangular two-dimensional strip packing problem real-life practical. Computers and Operations Research .; Pantoja, G., Álvarez, R., Parreño, F., & Álvarez, D. (2022). Nueva mate-heurística para solucionar el Strip Packing Problem con piezas irregulares (SPPI). IV Congreso Colombiano de Investigación Operativa ASOCIO 2022 - IISE REGIÓN 16.; Ren, Z., Yuan, J., & Liu, W. (2017). Minimum Near-Convex Shape Decomposition. IEEE Transactions on pattern analysis and machine intelligence, 1194-1204.; Saracevic, M., & Selimi, A. (2019). Convex polygon triangulation based on planted trivalent binary tree\\and ballot problem. Turkish Journal of Electrical Engineering and Computer Sciences.; Schachter, B. (1978). Decomposition of polygons into convex sets. IEEE Transactions on Computers.; Taranilla, M., Gagliardi, E., Leguizamón, M., & Hernández, G. (2007). Descomposición de Minkowski usando Algoritmos Genéticos. In IX Workshop de Investigadores en Ciencias de la Computación.; Wei, Z., Ding, S., Cheng, L., Xu, W., Wang, Y., & Zhang, L. (2022). Linear building pattern recognition in topographical maps combining convex polygon decomposition. Geocarto International, 1-25.; Xu, Y.-x. (2019). An Efficient Heuristic Approach for Irregular Cutting Stock Problem in Ship Building Industry. Mathematical Problems in Engineering 7(11), 400.; http://hdl.handle.net/1992/67171Test; instname:Universidad de los Andes; reponame:Repositorio Institucional Séneca; repourl:https://repositorio.uniandes.edu.coTest/
الإتاحة: http://hdl.handle.net/1992/67171Test
-
4دورية أكاديمية
المصدر: CQD Revista Eletrônica Paulista de Matemática, Vol 11 (2017)
مصطلحات موضوعية: Polígonos convexos, Quadriláteros, Fórmula de Bretschneider, Fórmula de Brahmagupta, Fórmula de Heron., Mathematics, QA1-939
وصف الملف: electronic resource
-
5دورية أكاديمية
المؤلفون: Podestá, Ricardo A.
المصدر: Revista de Educación Matemática (RevEM), ISSN 0326-8780, Vol. 37, Nº. 1, 2022, pags. 31-60
مصطلحات موضوعية: Embaldosados, Polígonos convexos, Polígonos regulares, Tilings, Plane, convex polygons, regular polygons
وصف الملف: application/pdf
العلاقة: https://dialnet.unirioja.es/servlet/oaiart?codigo=8833007Test; (Revista) ISSN 1852-2890; (Revista) ISSN 0326-8780
-
6
المؤلفون: BATISTA, Fernando da Silva.
المساهمون: FERNANDES, José de Arimatéia., ANDRADE , Lenimar Nunes de., MEDEIROS, Luiz Antônio da Silva.
المصدر: Biblioteca Digital de Teses e Dissertações da UFCG
Universidade Federal de Campina Grande (UFCG)
instacron:UFCGمصطلحات موضوعية: Polígonos não-convexos, Fórmula de Pick, Convex polygons, Matemática, Pick Formula, Área de triângulos, Area of triangles, Área de polígonos, Non-convex polygons, Area of polygons, Polígonos convexos
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=od______3056::35ec08ead6576869405e68cdbee03be2Test
http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/2183Test -
7دورية أكاديمية
المؤلفون: SERGIO LIFSCHITZ
المساهمون: CELSO DA CRUZ CARNEIRO RIBEIRO
مصطلحات موضوعية: [pt] POLIGONOS CONVEXOS, [en] CONVEX POLYGONS, [pt] ALGORITMO LINEAR, [en] LINEAR ALGORITHM
الإتاحة: https://doi.org/10.17771/PUCRio.acad.9412Test
https://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9412@1Test
https://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9412@2Test -
8مورد إلكتروني
المصدر: Revista de Educación Matemática (RevEM), ISSN 0326-8780, Vol. 37, Nº. 1, 2022, pags. 31-60
مصطلحات الفهرس: Embaldosados, Polígonos convexos, Polígonos regulares, Tilings, Plane, convex polygons, regular polygons, text (article)