Efficient Algorithms for Constructing a Pyramid from a Terrain*This paper was presented at Japan Conference on Discrete and Computation Geometry 2002 (JCDCG 2002).

Authors:
Jinhee Chun;Kunihiko Sadakane;Takeshi Tokuyama
Affiliations:
The authors are with the Graduate School of Information Sciences (GSIS), Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: jinhee@dais.is.tohoku.ac.jp,;The author is with the Graduate School of System Information Science, Kyushu University, Fukuoka-shi, 812--8581 Japan. E-mail: sada@csce.kyushu-u.ac.jp;The authors are with the Graduate School of Information Sciences (GSIS), Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: jinhee@dais.is.tohoku.ac.jp,
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 2

Maximum weight digital regions decomposable into digital star-shaped regions

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On maximum weight objects decomposable into based rectilinear convex objects

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [5], the following pyramid construction problem was proposed: Given nonnegative valued functions ρ and μ in d variables, we consider the optimal pyramid maximizing the total parametric gain of ρ against μ. The pyramid can be considered as the optimal unimodal approximation of ρ relative to μ, and can be applied to hierarchical data segmentation. In this paper, we give efficient algorithms for a couple of two-dimensional pyramid construction problems.