Close-to-optimal algorithm for rectangular decomposition of 3D shapes.

DOI10.14736/KYB-2019-5-0755MaRDI QIDQ5218999zbMATH OpenOpenAlexFDO

Authors Cyril Höschl IV, Jan Flusser

Publication date 6 March 2020

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/147950

zbMATH Keywords

decompositionmaximum independent settripartite graphvoxelssub-optimal algorithmrectangular blocks3D binary object

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm
• Strategies for polyhedral surface decomposition: an experimental study.
• PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS
• The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
• A dual of the rectangle-segmentation problem for binary matrices

Cites work

• scientific article; zbMATH DE number 3700274 (Why is no real title available?)
• scientific article; zbMATH DE number 1424299 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• A new approach to the maximum-flow problem
• A new computation of shape moments via quadtree decomposition
• Algorithm 457: finding all cliques of an undirected graph
• Beyond the flow decomposition barrier
• Blind Image Deconvolution
• Computational geometry. Algorithms and applications.
• Computing geometric moments using morphological erosions
• Efficient Algorithms for Geometric Graph Search Problems
• Efficient and accurate computation of geometric moments on gray-scale images
• Graph-Theoretic Solutions to Computational Geometry Problems
• Measuring shape
• Minimal rectangular partitions of digitized blobs
• Minimum decomposition of a digital surface into digital plane segments is NP-hard
• On a Method of Binary-Picture Representation and Its Application to Data Compression
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Refined moment calculation using image block representation
• Retrieving articulated 3-D models using medial surfaces
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(1)

• PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS

Describes a project that uses

Uses Software

• Algorithm 457

This page was built for publication: Close-to-optimal algorithm for rectangular decomposition of 3D shapes.

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