3D Rectangulations and Geometric Matrix Multiplication

DOI10.1007/978-3-319-13075-0_6zbMath1386.68194OpenAlexW1781284915MaRDI QIDQ2942614

Dzmitry Sledneu, Jesper Jansson, Peter Floderus, Christos Levcopoulos, Andrzej Lingas

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_6

zbMATH Keywords

polyhedrontime complexitymatrix multiplicationgeometric decompositionsminimum number rectangulation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Finding a manhattan path and related problems
• Powers of tensors and fast matrix multiplication
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 3D Rectangulations and Geometric Matrix Multiplication