Rectangularization of digital objects and its relation with straight skeletons

DOI10.1007/978-3-031-23612-9_2zbMath1528.68388OpenAlexW4313445077MaRDI QIDQ6166828

Mousumi Dutt, Arindam Biswas, Anukul Maity

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-23612-9_2

zbMATH Keywords

orthogonal polygonshape analysisstraight skeletonminimal partitionrectangular decompositioninner isotheic cover

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the stabbing number of matchings, trees, and triangulations
• Triangulating a simple polygon
• Rectilinear decompositions with low stabbing number
• Approximate convex decomposition of polygons
• Decomposing a Polygon into Simpler Components
• Some NP-hard polygon decomposition problems
• Decomposition of Polygons into Convex Sets
• Covering Polygons Is Hard
• Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons

This page was built for publication: Rectangularization of digital objects and its relation with straight skeletons