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

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

Research output: Chapter in Book/Report/Conference proceedingChapter

22 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsKyung-Yong Chwa, J. Ian Munro
PublisherSpringer Verlag
Pages238-248
Number of pages11
ISBN (Electronic)354022856X, 9783540228561
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3106
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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