PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS

DOI10.1142/S0129054103002084zbMath1101.68911OpenAlexW1975769458MaRDI QIDQ5696945

Anuj Jain, Jatinder Palta, James F. Dempsey, Sartaj K. 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)

Related Items (1)

CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES

Cites Work

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

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