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

DOI10.1142/S0218195999000340zbMATH Open1074.52503OpenAlexW2146559927MaRDI QIDQ4682201FDOQ4682201

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

Recommendations

• Minimum convex partition of a polygon with holes by cuts in given directions
• Minimum convex partition of a polygon with holes by cuts in given directions
• On convex partitions of polygonal regions
• scientific article; zbMATH DE number 3883609
• Minimum convex partition of polygonal domains by guillotine cuts

zbMATH Keywords

polygonal domainConvex partitiondegenerate holes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Minimum convex partition of a polygon with holes by cuts in given directions
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682201)