Carola Wenk

Orcid: 0000-0001-9275-5336

Affiliations:
  • Tulane University, New Orleans, LA, USA


According to our database1, Carola Wenk authored at least 83 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
In Silico Human Mobility Data Science: Leveraging Massive Simulated Mobility Data (Vision Paper).
ACM Trans. Spatial Algorithms Syst., June, 2024

Mobility Data Science: Perspectives and Challenges.
ACM Trans. Spatial Algorithms Syst., June, 2024

Distance measures for geometric graphs.
Comput. Geom., March, 2024

Approximating Gromov-Hausdorff distance in Euclidean space.
Comput. Geom., January, 2024

Rapid and Precise Topological Comparison with Merge Tree Neural Networks.
CoRR, 2024

Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition).
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Urban life: a model of people and places.
Comput. Math. Organ. Theory, March, 2023

Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries.
Discret. Comput. Geom., 2023

Visualizing Topological Importance: A Class-Driven Approach.
CoRR, 2023

Towards Mobility Data Science (Vision Paper).
CoRR, 2023

From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

On Length-Sensitive Fréchet Similarity.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Realizability of Free Spaces of Curves.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Massive Trajectory Data Based on Patterns of Life.
Proceedings of the 31st ACM International Conference on Advances in Geographic Information Systems, 2023

Metric and Path-Connectedness Properties of the Fréchet Distance for Paths and Graphs.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering.
IEEE Trans. Vis. Comput. Graph., 2022

On the Reconstruction of Geodesic Subspaces of ℝN.
Int. J. Comput. Geom. Appl., 2022

Mobility Data Science (Dagstuhl Seminar 22021).
Dagstuhl Reports, 2022

Simplification of Indoor Space Footprints.
Proceedings of the Spatial Gems, Volume 1, 2022

2021
Minimum-Complexity Graph Simplification under Fréchet-Like Distances.
CoRR, 2021

A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces.
CoRR, 2021

Distance measures for embedded graphs.
Comput. Geom., 2021

2020
Map-Matching Using Shortest Paths.
ACM Trans. Spatial Algorithms Syst., 2020

Inferring movement patterns from geometric similarity.
J. Spatial Inf. Sci., 2020

Simplification of Indoor Space Footprints.
CoRR, 2020

Middle curves based on discrete Fréchet distance.
Comput. Geom., 2020

Location-Based Social Network Data Generation Based on Patterns of Life.
Proceedings of the 21st IEEE International Conference on Mobile Data Management, 2020

Improved Map Construction using Subtrajectory Clustering.
Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
GeoSim 2019 workshop report: The 2nd ACM SIGSPATIAL International Workshop on Geospatial Simulation.
ACM SIGSPATIAL Special, 2019

Fast Fréchet Distance Between Curves with Long Edges.
Int. J. Comput. Geom. Appl., 2019

Topological and Geometric Reconstruction of Metric Graphs in R<sup>n</sup>.
CoRR, 2019

Threshold-Based Graph Reconstruction Using Discrete Morse Theory.
CoRR, 2019

Location-Based Social Simulation.
Proceedings of the 16th International Symposium on Spatial and Temporal Databases, 2019

Simulating Urban Patterns of Life: A Geo-Social Data Generation Framework.
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study.
Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science, 2019

Global Curve Simplification.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
On Optimal Min-# Curve Simplification Problem.
CoRR, 2018

On Map Construction, Map Comparison, and Trajectory Clustering.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072).
Dagstuhl Reports, 2017

A Unified Framework to Predict Movement.
Proceedings of the Advances in Spatial and Temporal Databases, 2017

Clustering Trajectories for Map Construction.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

2016
A Middle Curve Based on Discrete Fréchet Distance.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
A Path-Based Distance for Street Map Comparison.
ACM Trans. Spatial Algorithms Syst., 2015

A comparison and evaluation of map construction algorithms using vehicle tracking data.
GeoInformatica, 2015

Computing the Fréchet distance between folded polygons.
Comput. Geom., 2015

Choosing thresholds for density-based map construction algorithms.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Map Construction Algorithms
Springer, ISBN: 978-3-319-25166-0, 2015

2014
A Comparison and Evaluation of Map Construction Algorithms.
CoRR, 2014

Shortest Path Problems on a Polyhedral Surface.
Algorithmica, 2014

Local persistent homology based distance between maps.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

2013
Simple Curve Embedding
CoRR, 2013

Path-Based Distance for Street Map Comparison.
CoRR, 2013

Median Trajectories.
Algorithmica, 2013

2012
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time.
Discret. Comput. Geom., 2012

Partial Matching between Surfaces Using Fréchet Distance.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Constructing Street Networks from GPS Trajectories.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Link distance and shortest path problems in the plane.
Comput. Geom., 2011

Computing the Fréchet Distance between Folded Polygons.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Approximate Map Matching with respect to the Fréchet Distance.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Geodesic Fréchet distance inside a simple polygon.
ACM Trans. Algorithms, 2010

Guest Editors' foreword.
Comput. Geom., 2010

Visiting a Sequence of Points with a Bevel-Tip Needle.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
A new perspective on efficient and dependable vehicle routing.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

2008
Computing the Fréchet distance between simple polygons.
Comput. Geom., 2008

2006
Drawing with Fat Edges.
Int. J. Found. Comput. Sci., 2006

Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms.
Proceedings of the 18th International Conference on Scientific and Statistical Database Management, 2006

Fréchet Distance for Curves, Revisited.
Proceedings of the Algorithms, 2006

Computing the Fréchet distance between simple polygons in polynomial time.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Matching Polyhedral Terrains Using Overlays of Envelopes.
Algorithmica, 2005

On Map-Matching Vehicle Tracking Data.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

2004
Covering with Ellipses.
Algorithmica, 2004

Comparison of Distance Measures for Planar Curves.
Algorithmica, 2004

2003
Shape matching in higher dimensions.
PhD thesis, 2003

Applying an edit distance to the matching of tree ring sequences in dendrochronology.
J. Discrete Algorithms, 2003

Matching planar maps.
J. Algorithms, 2003

Finding a curve in a map.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels.
J. Comput. Biol., 2002

Covering shapes by ellipses.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Growing fat graphs.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001
Matching Polygonal Curves with Respect to the Fréchet Distance.
Proceedings of the STACS 2001, 2001

1999
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots.
Discret. Appl. Math., 1999

1998
Matching 2D Patterns of Protein Spots.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998


  Loading...