MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN

DOI10.1142/S0218195999000340zbMath1074.52503OpenAlexW2146559927MaRDI QIDQ4682201

Valeriu Soltan, Horst Martini

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195999000340

zbMATH Keywords

polygonal domainConvex partitiondegenerate holes

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Cites Work

• On the minimality of polygon triangulation
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• On convex partitions of polygonal regions
• Minimum convex partition of polygonal domains by guillotine cuts
• A Generalization of a Theorem of Tietze and Nakajima on Local Convexity
• Optimal Three-Layer Channel Routing
• Minimal rectangular partitions of digitized blobs

This page was built for publication: MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN