Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#313245] of Pankaj K. Agarwal

Papers Published

  1. Agarwal, PK; Mølhave, T; Revsbæk, M; Safa, I; Wang, Y; Yang, J, Maintaining Contour Trees of Dynamic Terrains, Leibniz International Proceedings in Informatics, Lipics, vol. 34 (June, 2015), pp. 796-811, ISSN 1868-8969 [doi]
    (last updated on 2018/10/18)

    We study the problem of maintaining the contour tree T of a terrain σ, 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. 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 κ become equal only O(1) times and these instances can be computed in O(1) time, the KDS processes O(κ + n) events, where n is the number of vertices in σ and κ; 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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320