Martin P. Seybold

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Online List Labeling with Near-Logarithmic Writes 2024 Martin P. Seybold
+ Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance 2024 Joachim Gudmundsson
Martin P. Seybold
Sampson Wong
+ PDF Chat Covering Rectilinear Polygons with Area-Weighted Rectangles 2024 Kathrin Hanauer
Martin P. Seybold
Julian Unterweger
+ PDF Chat On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance 2023 Joachim Gudmundsson
John Pfeifer
Martin P. Seybold
+ PDF Chat Map matching queries on realistic input graphs under the Fréchet distance 2023 Joachim Gudmundsson
Martin P. Seybold
Sampson Wong
+ B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load 2023 Roodabeh Safavi
Martin P. Seybold
+ On the Complexity of Algorithms with Predictions for Dynamic Graph Problems 2023 Monika Henzinger
Andrea Lincoln
Barna Saha
Martin P. Seybold
Christopher Ye
+ Covering Rectilinear Polygons with Area-Weighted Rectangles 2023 Kathrin Hanauer
Martin P. Seybold
Julian Unterweger
+ PDF Chat A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures 2022 Joachim Gudmundsson
Martin P. Seybold
+ PDF Chat Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG 2022 Milutin Brankovic
Martin P. Seybold
+ Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language 2022 Joachim Gudmundsson
Martin P. Seybold
John D. Pfeifer
+ On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance 2022 Joachim Gudmundsson
John Pfeifer
Martin P. Seybold
+ PDF Chat Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language 2022 Joachim Gudmundsson
Martin P. Seybold
John Pfeifer
+ Map matching queries on realistic input graphs under the Fréchet distance 2022 Joachim Gudmundsson
Martin P. Seybold
Sampson Wong
+ PDF Chat Optimal Window Queries on Line Segments using the Trapezoidal Search DAG 2021 Milutin Brankovic
Martin P. Seybold
+ PDF Chat On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance 2021 Joachim Gudmundsson
Martin P. Seybold
John Pfeifer
+ PDF Chat A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories 2021 Joachim Gudmundsson
Michael Horton
John Pfeifer
Martin P. Seybold
+ Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size 2021 Joachim Gudmundsson
Martin P. Seybold
Sampson Wong
+ A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures 2021 Joachim Gudmundsson
Martin P. Seybold
+ Optimal Window Queries on Line Segments using the Trapezoidal Search DAG 2021 Milutin Brankovic
Martin P. Seybold
+ A Practical Index Structure Supporting Fr\'echet Proximity Queries Among Trajectories 2020 Joachim Gudmundsson
Michael Horton
John Pfeifer
Martin P. Seybold
+ A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. 2020 Milutin Brankovic
Nikola Grujic
André van Renssen
Martin P. Seybold
+ A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions 2019 Milutin Brankovic
Nikola Grujic
André van Renssen
Martin P. Seybold
+ A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions 2019 Milutin Brankovic
Nikola Grujić
André van Renssen
Martin P. Seybold
+ PDF Chat Estimating fluid flow rates through fracture networks using combinatorial optimization 2018 Alex Hobé
Daniel Vogler
Martin P. Seybold
Anozie Ebigbo
Randolph R. Settgast
Martin O. Saar
+ Rational Points on the Unit Sphere: Approximation Complexity and Practical Constructions 2017 Daniel Bahrdt
Martin P. Seybold
+ swingx-core.jar 2016 Martin P. Seybold
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat A fast implementation of near neighbors queries for Fréchet distance (GIS Cup) 2017 Julian Baldus
Karl Bringmann
6
+ PDF Chat A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories 2021 Joachim Gudmundsson
Michael Horton
John Pfeifer
Martin P. Seybold
5
+ PDF Chat Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance 2017 Kevin Buchin
Maike Buchin
Wouter Meulemans
Wolfgang Mulzer
5
+ PDF Chat Bounded geometries, fractals, and low-distortion embeddings 2004 Anupam Gupta
Robert Krauthgamer
J.R. Lee
4
+ PDF Chat Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts 2013 Anne Driemel
Sariel Har-Peled
3
+ PDF Chat Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails 2014 Karl Bringmann
3
+ PDF Chat Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance 2022 Karl Bringmann
Anne Driemel
André Nusser
Ioannis Psarros
3
+ PDF Chat Improved Implementation of Point Location in General Two-Dimensional Subdivisions 2012 Michael Hemmer
Michal Kleinbort
Dan Halperin
2
+ PDF Chat Optimal randomized incremental construction for guaranteed logarithmic planar point location 2016 Michael Hemmer
Michal Kleinbort
Dan Halperin
2
+ PDF Chat Computing the Discrete Fréchet Distance in Subquadratic Time 2014 Pankaj Agarwal
Rinat Ben Avraham
Haim Kaplan
Micha Sharir
2
+ PDF Chat Hierarchical clustering using mutual information 2005 Alexander Kraskov
Harald Stögbauer
Ralph G. Andrzejak
Peter Grassberger
2
+ Applications of random sampling in computational geometry, II 1988 Kenneth L. Clarkson
2
+ PDF Chat Modeling flow and transport in fracture networks using graphs 2018 Satish Karra
Daniel O’Malley
Jeffrey D. Hyman
Hari Viswanathan
G. Srinivasan
1
+ PDF Chat Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds 2017 Karl Bringmann
Marvin KĂŒnnemann
1
+ PDF Chat Estimating fluid flow rates through fracture networks using combinatorial optimization 2018 Alex Hobé
Daniel Vogler
Martin P. Seybold
Anozie Ebigbo
Randolph R. Settgast
Martin O. Saar
1
+ PDF Chat Parallel Range, Segment and Rectangle Queries with Augmented Maps 2019 Yihan Sun
Guy E. Blelloch
1
+ PDF Chat SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension 2019 Kevin Buchin
Tim Ophelders
Bettina Speckmann
1
+ PDF Chat On the complexity of range searching among curves 2018 Peyman Afshani
Anne Driemel
1
+ PDF Chat Spatial Temporal Graph Convolutional Networks for Skeleton-Based Action Recognition 2018 Sijie Yan
Yuanjun Xiong
Dahua Lin
1
+ PDF Chat Hardness of approximate nearest neighbor search 2018 Aviad Rubinstein
1
+ PDF Chat NTU RGB+D: A Large Scale Dataset for 3D Human Activity Analysis 2016 Amir Shahroudy
Jun Liu
Tian-Tsong Ng
Gang Wang
1
+ PDF Chat A Survey on Map-Matching Algorithms 2020 Pingfu Chao
Yehong Xu
Wen Hua
Xiaofang Zhou
1
+ A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. 2020 Milutin Brankovic
Nikola Grujic
André van Renssen
Martin P. Seybold
1
+ PDF Chat More on Change-Making and Related Problems 2021 Younan Gao
Meng He
Yakov Nekrich
1
+ Approximating the Packedness of Polygonal Curves 2020 Joachim Gudmundsson
Yuan Sha
Sampson Wong
1
+ PDF Chat Static and Streaming Data Structures for Fréchet Distance Queries 2021 Arnold Filtser
Omrit Filtser
1
+ An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford) 1946 T. A. A. B.
1
+ PDF Chat Translation Invariant Fréchet Distance Queries 2021 Joachim Gudmundsson
André van Renssen
Zeinab Saeidi
Sampson Wong
1
+ PDF Chat Applications of random sampling in computational geometry, II 1989 Kenneth L. Clarkson
Peter W. Shor
1
+ A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions 2019 Milutin Brankovic
Nikola Grujić
André van Renssen
Martin P. Seybold
1
+ Locality-sensitive hashing of curves 2017 Anne Driemel
Francesco Silvestri
1
+ A tail estimate for Mulmuley's segment intersection algorithm 1992 JiĆ™Ä±Ì MatouĆĄek
Raimund Seidel
1
+ PDF Chat Four results on randomized incremental constructions 1992 Kenneth L. Clarkson
Kurt Mehlhorn
Raimund Seidel
1
+ Fluid Flow Complexity in Fracture Networks: Analysis with Graph Theory and LBM 2011 H. O. Ghaffari
M. H. B. Nasseri
R. P. Young
1
+ Continuum percolation for randomly oriented soft-core prisms 2002 Martin O. Saar
Michael Manga
1
+ Fast Construction of Nets in Low-Dimensional Metrics and Their Applications 2006 Sariel Har-Peled
Manor Mendel
1
+ PDF Chat A unifying look at data structures 1980 Jean Vuillemin
1
+ PDF Chat Orthogonal range searching on the RAM, revisited 2011 Timothy M. Chan
Kasper Green Larsen
Mihai PătraƟcu
1
+ Approximability of the discrete Fréchet distance 2016 Karl Bringmann
Wolfgang Mulzer
1
+ Applying Deep Learning to Basketball Trajectories 2016 Rajiv Ratn Shah
Rob Romijnders
1
+ On multidimensional Diophantine approximation of algebraic numbers 2016 Attila Pethö
Michael Pohst
CsanĂĄd BertĂłk
1
+ Sur des classes trĂšs-Ă©tendues de quantitĂ©s dont la valeur n'est ni algĂ©brique, ni mĂȘme rĂ©ductible Ă  des irrationnelles algĂ©briques. 1851 J. Liouville
1