Minimum convex partition of a polygon with holes by cuts in given directions

DOI10.1007/BFB0009508MaRDI QIDQ6487451zbMATH OpenFDO

Authors Andrzej Lingas, Valeriu Soltan

Publication date 25 January 2023

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Minimum convex partition of a polygon with holes by cuts in given directions
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• 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

Cites work

• scientific article; zbMATH DE number 3890258 (Why is no real title available?)
• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• scientific article; zbMATH DE number 4037201 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3767037 (Why is no real title available?)
• scientific article; zbMATH DE number 3793444 (Why is no real title available?)
• scientific article; zbMATH DE number 3594676 (Why is no real title available?)
• scientific article; zbMATH DE number 3598499 (Why is no real title available?)
• scientific article; zbMATH DE number 589122 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• An O(n log n) Manhattan path algorithm
• Decomposing a Polygon into Simpler Components
• Efficient Algorithms for Geometric Graph Search Problems
• Finding a manhattan path and related problems
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Partition of a plane set into a finite number of d-convex parts
• Planar Formulae and Their Uses
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Some NP-hard polygon decomposition problems

Cited in

(5)

• Rectangularization of digital objects and its relation with straight skeletons
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Minimum Convex Partitions and Maximum Empty Polytopes
• Minimum stabbing rectangular partitions of rectilinear polygons
• scientific article; zbMATH DE number 495506 (Why is no real title available?)

This page was built for publication: Minimum convex partition of a polygon with holes by cuts in given directions

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