Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain

Danny Z. Chen; Jinhee Chun; Naoki Katoh; Takeshi Tokuyama

Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain

Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

21 Citations (Scopus)

Abstract

We consider the problem of approximating a function on a d-dimensional voxel grid by a unimodal function to minimize the L₂ approximation error with respect to a given measure distribution on the grid. The output unimodal function gives a layered structure on the voxel grid, and we give efficient algorithms for computing the optimal approximation under a reasonable assumption on the shape of each horizontal layer. Our main technique is a dominating cut algorithm for a graph.

Original language	English
Pages (from-to)	238-248
Number of pages	11
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3106
Publication status	Published - 2004 Dec 1

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

Fingerprint Dive into the research topics of 'Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain'. Together they form a unique fingerprint.

Cite this

Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain. / Chen, Danny Z.; Chun, Jinhee; Katoh, Naoki; Tokuyama, Takeshi.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3106, 01.12.2004, p. 238-248.

Research output: Contribution to journal › Article › peer-review

@article{cc8e3e567e9c4ff4853404a2dc2e302d,

title = "Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain",

abstract = "We consider the problem of approximating a function on a d-dimensional voxel grid by a unimodal function to minimize the L2 approximation error with respect to a given measure distribution on the grid. The output unimodal function gives a layered structure on the voxel grid, and we give efficient algorithms for computing the optimal approximation under a reasonable assumption on the shape of each horizontal layer. Our main technique is a dominating cut algorithm for a graph.",

author = "Chen, {Danny Z.} and Jinhee Chun and Naoki Katoh and Takeshi Tokuyama",

year = "2004",

month = dec,

day = "1",

language = "English",

volume = "3106",

pages = "238--248",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain

AU - Chen, Danny Z.

AU - Chun, Jinhee

AU - Katoh, Naoki

AU - Tokuyama, Takeshi

PY - 2004/12/1

Y1 - 2004/12/1

N2 - We consider the problem of approximating a function on a d-dimensional voxel grid by a unimodal function to minimize the L2 approximation error with respect to a given measure distribution on the grid. The output unimodal function gives a layered structure on the voxel grid, and we give efficient algorithms for computing the optimal approximation under a reasonable assumption on the shape of each horizontal layer. Our main technique is a dominating cut algorithm for a graph.

AB - We consider the problem of approximating a function on a d-dimensional voxel grid by a unimodal function to minimize the L2 approximation error with respect to a given measure distribution on the grid. The output unimodal function gives a layered structure on the voxel grid, and we give efficient algorithms for computing the optimal approximation under a reasonable assumption on the shape of each horizontal layer. Our main technique is a dominating cut algorithm for a graph.

UR - http://www.scopus.com/inward/record.url?scp=35048835850&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048835850&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048835850

VL - 3106

SP - 238

EP - 248

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -