Effect of corner information in simultaneous placement of K rectangles and tableaux

Authors:
Shinya Anzai;Jinhee Chun;Ryosei Kasai;Matias Korman;Takeshi Tokuyama
Affiliations:
Graduate School of Information Sciences, Tohoku University, Japan;Graduate School of Information Sciences, Tohoku University, Japan;Graduate School of Information Sciences, Tohoku University, Japan;Computer Science Department, Université Libre de Bruxelles, Belgium;Graduate School of Information Sciences, Tohoku University, Japan
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 9
Cited 1

A packing problem with applications to lettering of maps

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

Discrete & Computational Geometry
Algorithms for the maximum subarray problem based on matrix multiplication

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Programming pearls: algorithm design techniques

Communications of the ACM
Data Mining with optimized two-dimensional association rules

ACM Transactions on Database Systems (TODS)
Improved Algorithms for the K-Maximum Subarray Problem

The Computer Journal
Consistent digital rays

Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A sub-cubic time algorithm for the k-maximum subarray problem

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Algorithms for computing the maximum weight region decomposable into elementary shapes

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n × n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.