QR Kod

Exact and Heuristic Algorithms for Convex Polygon Decomposition

Convex decomposition plays a central role in computational geometry and is a key preprocessing step in applications such as robotic motion planning, 2D packing, pattern recognition, and manufacturing. This work revisits the minimum convex decomposition problem and proposes both an exact mathematical...

Ful tanımlama

Kaydedildi:
Asıl Yazarlar: Johana Milena Martínez Contreras, Germán Fernando Pantoja Benavides, Astrid Xiomara Rodríguez, John Willmer Escobar, David Álvarez-Martínez
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: MDPI AG 2025-12-01
Seri Bilgileri:Mathematics
Konular:
polygon convex decomposition
heuristic approaches
exact algorithms
Online Erişim:https://www.mdpi.com/2227-7390/13/24/4038
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller