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

DOI10.14736/kyb-2019-5-0755OpenAlexW3004262688MaRDI QIDQ5218999

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)

Uses Software

• Algorithm 457

Cites Work

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

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