PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS

DOI10.1142/S0129054103002084MaRDI QIDQ5696945zbMATH OpenOpenAlexFDO

Authors Anuj Jain, Jatinder Palta, James F. Dempsey, Sartaj Sahni

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054103002084

zbMATH Keywords

heuristiccuboids3D phantom partitioning

Mathematics Subject Classification ID

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

Recommendations

• Partitioning orthogonal histograms into rectangular boxes
• scientific article; zbMATH DE number 4175876
• Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
• On heuristics for minimum length rectilinear partitions
• Cuboid partitioning for parallel matrix multiplication on heterogeneous platforms

Cites work

• Efficient Algorithms for Geometric Graph Search Problems
• Rectangular partition is polynomial in two dimensions but NP-complete in three

Cited in

(2)

• Cartesian product partitioning of multi-dimensional reachable state spaces
• Close-to-optimal algorithm for rectangular decomposition of 3D shapes.

This page was built for publication: PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS

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