Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application

DOI10.1007/978-3-319-06569-4_5zbMath1323.05106OpenAlexW19428926MaRDI QIDQ3192956

Thanh Hai Nguyen

Publication date: 14 October 2015

Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06569-4_5

zbMATH Keywords

linear programmingcomputational geometryapplied graph theorypolygon partitioningmemory protection

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Approximate convex decomposition of polygons
• Finding a manhattan path and related problems
• Efficient Algorithms for Geometric Graph Search Problems
• Minimal rectangular partitions of digitized blobs
• QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application