License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.796
URN: urn:nbn:de:0030-drops-51406
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5140/
Go to the corresponding LIPIcs Volume Portal


Agarwal, Pankaj K. ; Mølhave, Thomas ; Revsbæk, Morten ; Safa, Issam ; Wang, Yusu ; Yang, Jungwoo

Maintaining Contour Trees of Dynamic Terrains

pdf-format:
57.pdf (1 MB)


Abstract

We study the problem of maintaining the contour tree T of a terrain Sigma, represented as a triangulated xy-monotone surface, as the heights of its vertices vary continuously with time. We characterize the combinatorial changes in T and how they relate to topological changes in Sigma. We present a kinetic data structure (KDS) for maintaining T efficiently. It maintains certificates that fail, i.e., an event occurs, only when the heights of two adjacent vertices become equal or two saddle vertices appear on the same contour. Assuming that the heights of two vertices of Sigma become equal only O(1) times and these instances can be computed in O(1) time, the KDS processes O(kappa + n) events, where n is the number of vertices in Sigma and kappa is the number of events at which the combinatorial structure of T changes, and processes each event in O(log n) time. The KDS can be extended to maintain an augmented contour tree and a join/split tree.

BibTeX - Entry

@InProceedings{agarwal_et_al:LIPIcs:2015:5140,
  author =	{Pankaj K. Agarwal and Thomas M\olhave and Morten Revsbæk and Issam Safa and Yusu Wang and Jungwoo Yang},
  title =	{{Maintaining Contour Trees of Dynamic Terrains}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{796--811},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5140},
  URN =		{urn:nbn:de:0030-drops-51406},
  doi =		{10.4230/LIPIcs.SOCG.2015.796},
  annote =	{Keywords: Contour tree, dynamic terrain, kinetic data structure}
}

Keywords: Contour tree, dynamic terrain, kinetic data structure
Collection: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 12.06.2015


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI