Carola Wenk

According to our database1, Carola Wenk authored at least 63 papers between 1998 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Fast fréchet distance between curves with long edges.
Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Map-matching using shortest paths.
Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

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

Fast Fréchet Distance Between Curves With Long Edges.
CoRR, 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 and Systems, 2015

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

Fréchet Distance for Curves, Revisited.
CoRR, 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.
Discrete & Computational Geometry, 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
Computing the Fréchet Distance Between Folded Polygons
CoRR, 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

Approximating the Fréchet Distance for Realistic Curves in Near Linear Time
CoRR, 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

Median Trajectories.
Proceedings of the Algorithms, 2010

Approximating the Fréchet distance for realistic curves in near linear time.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Shortest Path Problems on a Polyhedral Surface.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 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

Shortest Path Problems on a Polyhedral Surface.
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

Link Distance and Shortest Path Problems in the Plane.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Geodesic Fréchet Distance Inside a Simple Polygon
CoRR, 2008

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

Geodesic Fréchet Distance Inside a Simple Polygon.
Proceedings of the STACS 2008, 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

Matching Polyhedral Terrains Using Overlays of Envelopes.
Proceedings of the Algorithm Theory, 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

Matching planar maps.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete 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.
Journal of Computational Biology, 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, Barcelona, 2002

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

Geometric algorithms for the analysis of 2D-electrophoresis gels.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Drawing with Fat Edges.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots.
Discrete Applied Mathematics, 1999

Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

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


  Loading...