### Abstract

Original language | English |
---|---|

Title of host publication | Approximation and Online Algorithms (6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers) |

Editors | E. Bampis, M. Skutella |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 214-226 |

ISBN (Print) | 978-3-540-93979-5 |

DOIs | |

Publication status | Published - 2009 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Volume | 5426 |

ISSN (Print) | 0302-9743 |

### Fingerprint

### Cite this

*Approximation and Online Algorithms (6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers)*(pp. 214-226). (Lecture Notes in Computer Science; Vol. 5426). Berlin: Springer. https://doi.org/10.1007/978-3-540-93980-1_17

}

*Approximation and Online Algorithms (6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers).*Lecture Notes in Computer Science, vol. 5426, Springer, Berlin, pp. 214-226. https://doi.org/10.1007/978-3-540-93980-1_17

**Smoothing imprecise 1.5D terrains.** / Gray, C.M.; Löffler, M.; Silveira, R.I.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Smoothing imprecise 1.5D terrains

AU - Gray, C.M.

AU - Löffler, M.

AU - Silveira, R.I.

PY - 2009

Y1 - 2009

N2 - We study optimization problems in an imprecision model for polyhedral terrains. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to 1.5-dimensional terrains: an imprecise terrain is given by an x-monotone polyline, and the y-coordinate of each vertex is not fixed but constrained to a given interval. Motivated by applications in terrain analysis, in this paper we present two linear-time approximation algorithms, for minimizing the largest turning angle and for maximizing the smallest one. In addition, we also provide linear time exact algorithms for minimizing and maximizing the sum of the turning angles.

AB - We study optimization problems in an imprecision model for polyhedral terrains. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to 1.5-dimensional terrains: an imprecise terrain is given by an x-monotone polyline, and the y-coordinate of each vertex is not fixed but constrained to a given interval. Motivated by applications in terrain analysis, in this paper we present two linear-time approximation algorithms, for minimizing the largest turning angle and for maximizing the smallest one. In addition, we also provide linear time exact algorithms for minimizing and maximizing the sum of the turning angles.

U2 - 10.1007/978-3-540-93980-1_17

DO - 10.1007/978-3-540-93980-1_17

M3 - Conference contribution

SN - 978-3-540-93979-5

T3 - Lecture Notes in Computer Science

SP - 214

EP - 226

BT - Approximation and Online Algorithms (6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers)

A2 - Bampis, E.

A2 - Skutella, M.

PB - Springer

CY - Berlin

ER -