Rectangularization of digital objects and its relation with straight skeletons

DOI10.1007/978-3-031-23612-9_2MaRDI QIDQ6166828zbMATH OpenOpenAlexFDO

Authors Anukul Maity, Mousumi Dutt, Arindam Biswas

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

inner isotheic coverminimal partitionorthogonal polygonrectangular decompositionshape analysisstraight skeleton

Mathematics Subject Classification ID

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

Recommendations

• Finding a largest rectangle inside a digital object and rectangularization
• Minimal rectangular partitions of digitized blobs
• Rectangular partitions of a rectilinear polygon
• ACCORD: With approximate covering of convex orthogonal decomposition
• On the structure of straight skeletons

Cites work

• Approximate convex decomposition of polygons
• Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
• Computational geometry. Algorithms and applications.
• Covering Polygons Is Hard
• Decomposing a Polygon into Simpler Components
• Decomposition of Polygons into Convex Sets
• Discrete and computational geometry
• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• scientific article; zbMATH DE number 3767037 (Why is no real title available?)
• Minimizing the stabbing number of matchings, trees, and triangulations
• Minimum convex partition of a polygon with holes by cuts in given directions
• Rectilinear decompositions with low stabbing number
• Some NP-hard polygon decomposition problems
• Triangulating a simple polygon

Cited in

(1)

• Vector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital Pathology

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

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