Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Wenk, Carola"'
Autor:
Amiri, Hossein, Kohn, Will, Ruan, Shiyang, Kim, Joon-Seok, Kavak, Hamdi, Crooks, Andrew, Pfoser, Dieter, Wenk, Carola, Zufle, Andreas
We demonstrate the Patterns of Life Simulation to create realistic simulations of human mobility in a city. This simulation has recently been used to generate massive amounts of trajectory and check-in data. Our demonstration focuses on using the sim
Externí odkaz:
http://arxiv.org/abs/2410.00185
Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due to the exhaustive matching between tree nodes. To address this challeng
Externí odkaz:
http://arxiv.org/abs/2404.05879
The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often, the quest
Externí odkaz:
http://arxiv.org/abs/2311.07573
This paper presents the first approach to visualize the importance of topological features that define classes of data. Topological features, with their ability to abstract the fundamental structure of complex data, are an integral component of visua
Externí odkaz:
http://arxiv.org/abs/2309.13185
Publikováno v:
Proc. 18th Algorithms and Data Structures Symposium. 605-619, 2023
Let $\gamma$ be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if $\gamma$ is self-overlapping by geometrically constructing a combinatorial word from $\gamma$. More recently, Zipei Nie, in an unpublished manu
Externí odkaz:
http://arxiv.org/abs/2309.02383
The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. More recently, the Frechet distance has been generalized to a distance
Externí odkaz:
http://arxiv.org/abs/2308.00900
Autor:
Mokbel, Mohamed, Sakr, Mahmoud, Xiong, Li, Züfle, Andreas, Almeida, Jussara, Anderson, Taylor, Aref, Walid, Andrienko, Gennady, Andrienko, Natalia, Cao, Yang, Chawla, Sanjay, Cheng, Reynold, Chrysanthis, Panos, Fei, Xiqi, Ghinita, Gabriel, Graser, Anita, Gunopulos, Dimitrios, Jensen, Christian, Kim, Joon-Seok, Kim, Kyoung-Sook, Kröger, Peer, Krumm, John, Lauer, Johannes, Magdy, Amr, Nascimento, Mario, Ravada, Siva, Renz, Matthias, Sacharidis, Dimitris, Shahabi, Cyrus, Salim, Flora, Sarwat, Mohamed, Schoemans, Maxime, Speckmann, Bettina, Tanin, Egemen, Teng, Xu, Theodoridis, Yannis, Torp, Kristian, Trajcevski, Goce, van Kreveld, Marc, Wenk, Carola, Werner, Martin, Wong, Raymond, Wu, Song, Xu, Jianqiu, Youssef, Moustafa, Zeinalipour, Demetris, Zhang, Mengxuan, Zimányi, Esteban
Mobility data captures the locations of moving objects such as humans, animals, and cars. With the availability of GPS-equipped mobile devices and other inexpensive location-tracking technologies, mobility data is collected ubiquitously. In recent ye
Externí odkaz:
http://arxiv.org/abs/2307.05717
Autor:
Majhi, Sushovan, Wenk, Carola
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two such geom
Externí odkaz:
http://arxiv.org/abs/2209.12869
Simplifying graphs is a very applicable problem in numerous domains, especially in computational geometry. Given a geometric graph and a threshold, the minimum-complexity graph simplification asks for computing an alternative graph of minimum complex
Externí odkaz:
http://arxiv.org/abs/2111.02591
Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances between diagrams is essential; however, computing these distances has been
Externí odkaz:
http://arxiv.org/abs/2105.12208