Joachim Gudmundsson

发表

Ordered theta graphs

Joachim Gudmundsson, Prosenjit Bose, Pat Morin, 2004, CCCG.

Editorial: COCOON 2012 Special Issue

Joachim Gudmundsson, Julián Mestre, Taso Viglas, 2014, Algorithmica.

Towards Automated Football Analysis: Algorithms and Data Structures

Joachim Gudmundsson, Thomas Wolle, Joachim Gudmundsson, 2010 .

Fréchet Queries in Geometric Trees

Joachim Gudmundsson, Michiel H. M. Smid, 2013, ESA.

Aperture-Angle and Hausdorff-Approximation of Convex Figures

Sang Won Bae, Joachim Gudmundsson, Otfried Cheong, 2008, Discret. Comput. Geom..

Approximating Minimum Manhattan Networks

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 1999, RANDOM-APPROX.

Approximate distance oracles for geometric spanners

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2008, TALG.

Notes on Large Angle Crossing Graphs

Joachim Gudmundsson, Pat Morin, Vida Dujmovic, 2009, Chic. J. Theor. Comput. Sci..

Fast Fréchet Distance Between Curves with Long Edges

Joachim Gudmundsson, Carola Wenk, Majid Mirzanezhad, 2019, Int. J. Comput. Geom. Appl..

Restricted Mesh Simplification Using Edge Contractions

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2006, COCOON.

Fast Fréchet queries

Joachim Gudmundsson, Mark de Berg, Atlas F. Cook, 2011, Comput. Geom..

Approximate Distance Oracles Revisited

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2002, ISAAC.

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Joachim Gudmundsson, Michiel H. M. Smid, Prosenjit Bose, 2017, Algorithmica.

Improving the dilation of a metric graph by adding edges pdf

Joachim Gudmundsson, Sampson Wong, 2020, ArXiv.

A GPU Approach to Subtrajectory Clustering Using the Fréchet Distance

Joachim Gudmundsson, Nacho Valladares, 2015, IEEE Trans. Parallel Distributed Syst..

On Algorithms for Computing the Diameter of a t-Spanner

Joachim Gudmundsson, Mohammad Farshi, 2006 .

Editorial, SEA 2014 Special Issue

Joachim Gudmundsson, Jyrki Katajainen, 2016, ACM J. Exp. Algorithmics.

Movement Patterns in Spatio-temporal Data

Joachim Gudmundsson, Thomas Wolle, Patrick Laube, 2008, Encyclopedia of GIS.

Reporting leadership patterns among trajectories

Joachim Gudmundsson, Thomas Wolle, Mattias Andersson, 2007, SAC '07.

On the Number of Upward Planar Orientations of Maximal Planar Graphs

Joachim Gudmundsson, Fabrizio Frati, Emo Welzl, 2012, ISAAC.

Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2016, Encyclopedia of Algorithms.

Computing longest duration flocks in trajectory data

Joachim Gudmundsson, Marc J. van Kreveld, M. V. Kreveld, 2006, GIS '06.

Minimum Weight Pseudo-Triangulations

Joachim Gudmundsson, Christos Levcopoulos, 2004, FSTTCS.

Geometric Spanners for Weighted Point Sets

Joachim Gudmundsson, Michiel H. M. Smid, Mark de Berg, 2010, Algorithmica.

Fast Fréchet queries

Joachim Gudmundsson, Mark de Berg, Atlas F. Cook, 2013, Comput. Geom..

Improving the Stretch Factor of a Geometric Network by Edge Augmentation

Joachim Gudmundsson, Panos Giannopoulos, Mohammad Farshi, 2008, SIAM J. Comput..

Algorithms for hotspot computation on trajectory data

Joachim Gudmundsson, Frank Staals, Marc J. van Kreveld, 2013, SIGSPATIAL/GIS.

Geometric Spanners for Weighted Point Sets

Joachim Gudmundsson, Michiel H. M. Smid, Mark de Berg, 2009, ESA.

Fast Algorithms for Diameter-Optimally Augmenting Paths

Joachim Gudmundsson, Michiel H. M. Smid, Christian Knauer, 2015, ICALP.

Lower bounds for approximate polygon decomposition and minimum gap

Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos, 2002, Inf. Process. Lett..

Analyzing delays in trajectories

Joachim Gudmundsson, Kevin Buchin, Maike Buchin, 2015, 2015 IEEE Pacific Visualization Symposium (PacificVis).

Turbocharging Treewidth Heuristics

Joachim Gudmundsson, Stefan Rümmele, Mitchell Jones, 2018, Algorithmica.

Box-trees and R-trees with near-optimal query time

Joachim Gudmundsson, Mark de Berg, Pankaj K. Agarwal, 2001, SCG '01.

Classification of Passes in Football Matches Using Spatiotemporal Data

Joachim Gudmundsson, Sanjay Chawla, Michael Horton, 2014, ACM Trans. Spatial Algorithms Syst..

Region-Restricted Clustering for Geographic Data Mining

Joachim Gudmundsson, Giri Narasimhan, Marc J. van Kreveld, 2006, ESA.

Improved Map Construction using Subtrajectory Clustering

Joachim Gudmundsson, Kevin Buchin, Maike Buchin, 2020, LocalRec@SIGSPATIAL.

Farthest-Polygon Voronoi Diagrams

Hazel Everett, Joachim Gudmundsson, Otfried Cheong, 2007, ESA.

Augmenting Graphs to Minimize the Diameter

Joachim Gudmundsson, Fabrizio Frati, Serge Gaspers, 2013, ISAAC.

A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories pdf

Joachim Gudmundsson, Michael Horton, John Pfeifer, 2020, ACM Trans. Spatial Algorithms Syst..

A Fast Approximation Algorithm for TSP with Neighborhoods

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1999, Nord. J. Comput..

Dilation and Detours in Geometric Networks

Joachim Gudmundsson, Christian Knauer, 2018 .

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2000, SWAT.

On the number of upward planar orientations of maximal planar graphs

Joachim Gudmundsson, Fabrizio Frati, Emo Welzl, 2014, Theor. Comput. Sci..

Compressing spatio-temporal trajectories

Joachim Gudmundsson, Thomas Wolle, Cahya Ong, 2009, Comput. Geom..

Distance-preserving approximations of polygonal paths

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2007, Comput. Geom..

Efficient detection of motion patterns in spatio-temporal data sets

Bettina Speckmann, Joachim Gudmundsson, Marc J. van Kreveld, 2004, GIS '04.

Football analysis using spatio-temporal tools

Joachim Gudmundsson, Thomas Wolle, Joachim Gudmundsson, 2012, Comput. Environ. Urban Syst..

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements

Joachim Gudmundsson, Stefan Rümmele, Julián Mestre, 2017, ISAAC.

Approximation Algorithms for Covering Polygons with Squares and Similar Problems

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1997, RANDOM.

Spatio-Temporal Analysis of Team Sports

Joachim Gudmundsson, Michael Horton, Joachim Gudmundsson, 2016, ACM Comput. Surv..

Proceedings of the 11th Scandinavian workshop on Algorithm Theory

Joachim Gudmundsson, 2008 .

Experimental Study of Geometric t-Spanners: A Running Time Comparison

Joachim Gudmundsson, Mohammad Farshi, Joachim Gudmundsson, 2007, WEA.

Efficient Detection of Patterns in 2D Trajectories of Moving Points

Bettina Speckmann, Joachim Gudmundsson, Marc J. van Kreveld, 2007, GeoInformatica.

Approximate distance oracles for geometric graphs

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2002, SODA '02.

On the expected maximum degree of Gabriel and Yao graphs

Joachim Gudmundsson, Pat Morin, Luc Devroye, 2009, Advances in Applied Probability.

Augmenting Graphs to Minimize the Diameter

Joachim Gudmundsson, Fabrizio Frati, Serge Gaspers, 2013, Algorithmica.

Constrained free space diagrams: a tool for trajectory analysis

Joachim Gudmundsson, Kevin Buchin, Maike Buchin, 2010, Int. J. Geogr. Inf. Sci..

Detecting Areas Visited Regularly

Joachim Gudmundsson, Bojan Djordjevic, 2010, COCOON.

Editorial (Special issue on 21st European Workshop on Computational Geometry (EWCG 2005), Eindhoven, The Netherlands, March 9-11, 2005)

Bettina Speckmann, Joachim Gudmundsson, de Mt Mark Berg, 2007 .

Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504

Joachim Gudmundsson, Jyrki Katajainen, 2014 .

Computing and Combinatorics

Joachim Gudmundsson, Julián Mestre, Taso Viglas, 2012, Lecture Notes in Computer Science.

Close Approximation of Minimum Rectangular Coverings

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1996, FSTTCS.

Finding Pairwise Intersections Inside a Query Range

Joachim Gudmundsson, Mark de Berg, Ali D. Mehrabi, 2017, Algorithmica.

Faster Algorithms for Computing Plurality Points

Joachim Gudmundsson, Mark de Berg, Mehran Mehr, 2018, SoCG.

Aperture-angle and Hausdorff-approximation of convex figures

Sang Won Bae, Joachim Gudmundsson, Otfried Cheong, 2007, SCG '07.

Experimental study of geometric t-spanners

Joachim Gudmundsson, Mohammad Farshi, Joachim Gudmundsson, 2005, JEAL.

A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data

Joachim Gudmundsson, Mark de Berg, Ali D. Mehrabi, 2017, SIGSPATIAL/GIS.

Approximating the packedness of polygonal curves

Joachim Gudmundsson, Yuan Sha, Sampson Wong, 2020, ISAAC.

Finding Popular Places

Joachim Gudmundsson, Thomas Wolle, Marc Benkert, 2010, Int. J. Comput. Geom. Appl..

Box-trees for collision checking in industrial installations

Joachim Gudmundsson, Mark de Berg, Herman J. Haverkort, 2002, SCG '02.

Applications of Geometric Spanner Networks

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2016, Encyclopedia of Algorithms.

A Generalization of the Convex Kakeya Problem

Sang Won Bae, Joachim Gudmundsson, Otfried Cheong, 2012, LATIN.

On Spanners of Geometric Graphs

Joachim Gudmundsson, Michiel H. M. Smid, 2006, SWAT.

Close Approximations of Minimum Rectangular Coverings

Joachim Gudmundsson, Christos Levcopoulos, 1999, J. Comb. Optim..

10491 Results of the break-out group: Gulls Data

Joachim Gudmundsson, Jörg-Rüdiger Sack, Mark de Berg, 2010, Representation, Analysis and Visualization of Moving Objects.

A Simple Algorithm for I/O-efficiently Pruning Dense Spanners

Joachim Gudmundsson, Jan Vahrenhold, 2004, Cache-Oblivious and Cache-Aware Algorithms.

Experimental Study of Geometric t-Spanners

Joachim Gudmundsson, Mohammad Farshi, 2005, ESA.

Path Simplification for Metro Map Layout

Joachim Gudmundsson, Damian Merrick, 2006, Graph Drawing.

Increasing-Chord Graphs On Point Sets

Joachim Gudmundsson, Fabrizio Frati, Hooman Reisi Dehkordi, 2015, J. Graph Algorithms Appl..

Constructing Plane Spanners of Bounded Degree and Low Weight

Joachim Gudmundsson, Prosenjit Bose, Michiel Smid, 2002, ESA.

Football analysis using spatio-temporal tools

Joachim Gudmundsson, Thomas Wolle, 2014, Comput. Environ. Urban Syst..

TSP with Neighborhoods of Varying Size

Joachim Gudmundsson, Mark de Berg, Matthew J. Katz, 2002, ESA.

Chips on Wafers

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2003, WADS.

A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract)

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1997, FCT.

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures pdf

Joachim Gudmundsson, Martin P. Seybold, 2021, ArXiv.

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining

Joachim Gudmundsson, Michiel H. M. Smid, Rolf Klein, 2009, Geometric Networks, Metric Space Embeddings and Spatial Data Mining.

Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65

Joachim Gudmundsson, Barry Jay, 2007 .

Approximating a Minimum Manhattan Network

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2001, Nord. J. Comput..

Constructing interference-minimal networks

Alexander Wolff, Joachim Gudmundsson, Herman J. Haverkort, 2005, EuroCG.

Computational Movement Analysis

Joachim Gudmundsson, Thomas Wolle, Patrick Laube, 2012, Springer Handbook of Geographic Information.

Shortcuts for the Circle

Sang Won Bae, Joachim Gudmundsson, Mark de Berg, 2017, ISAAC.

Sparse geometric graphs with small dilation pdf

Joachim Gudmundsson, Michiel H. M. Smid, Boris Aronov, 2008, Comput. Geom..

TSP with neighborhoods of varying size

Joachim Gudmundsson, Mark de Berg, Matthew J. Katz, 2005, J. Algorithms.

Finding Pairwise Intersections Inside a Query Range

Joachim Gudmundsson, Mark de Berg, Ali D. Mehrabi, 2015, WADS.

Beaconless geocast protocols are interesting, even in 1D

Joachim Gudmundsson, Maarten Löffler, Irina Kostitsyna, 2016, EuroCG 2016.

Finding the best shortcut in a geometric network

Joachim Gudmundsson, Panos Giannopoulos, Mohammad Farshi, 2005, EuroCG.

Shortcuts for the circle

Sang Won Bae, Joachim Gudmundsson, Mark de Berg, 2019, Comput. Geom..

Detecting Hotspots in Geographic Networks

Bettina Speckmann, Joachim Gudmundsson, Maarten Löffler, 2009, AGILE Conf..

Applications of Geometric Spanner Networks

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2008, Encyclopedia of Algorithms.

Constructing Sparse t-Spanners with Small Separators

Joachim Gudmundsson, Joachim Gudmundsson, 2003, FCT.

Shortest Path in Transportation Network and Weighted Subdivisions

Joachim Gudmundsson, Radwa El Shawi, 2011, Graph Data Management.

10491 Results of the break-out group: Similarity measures

Joachim Gudmundsson, Harvey J. Miller, Stefan van der Spek, 2010, Representation, Analysis and Visualization of Moving Objects.

Balanced Partition of Minimum Spanning Trees

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2002, International Conference on Computational Science.

Detecting single file movement

Joachim Gudmundsson, Kevin Buchin, Maike Buchin, 2008, GIS '08.

On graphs supporting greedy forwarding for directional wireless networks

Roksana Boreli, Joachim Gudmundsson, Albert Y. Zomaya, 2012, 2012 IEEE International Conference on Communications (ICC).

A Visual Measure of Changes to Weighted Self-Organizing Map Patterns pdf

Joachim Gudmundsson, Masahiro Takatsuka, Younjin Chung, 2017, ArXiv.

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings

Alexander Wolff, Joachim Gudmundsson, Giri Narasimhan, 2006, Geometric Networks and Metric Space Embeddings.

Area-preserving approximations of polygonal paths

Bettina Speckmann, Joachim Gudmundsson, Prosenjit Bose, 2006, J. Discrete Algorithms.

On Spanners of Geometric Graphs

Joachim Gudmundsson, Michiel H. M. Smid, 2009, Int. J. Found. Comput. Sci..

Distance-Preserving Approximations of Polygonal Paths

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2003, FSTTCS.

A simple and efficient kinetic spanner

Joachim Gudmundsson, Mark de Berg, Mohammad Ali Abam, 2008, SCG '08.

Sparse Geometric Graphs with Small Dilation

Joachim Gudmundsson, Boris Aronov, Mark de Berg, 2005, ISAAC.

Compressing Spatio-temporal Trajectories

Joachim Gudmundsson, Thomas Wolle, Cahya Ong, 2007, ISAAC.

Computing the Yolk in Spatial Voting Games without Computing Median Lines pdf

Joachim Gudmundsson, Sampson Wong, Joachim Gudmundsson, 2019, AAAI.

An ILP for the metro-line crossing problem

Joachim Gudmundsson, Damian Merrick, Matthew Asquith, 2008, CATS.

When is Red-Blue Nonblocker Fixed-Parameter Tractable?

Joachim Gudmundsson, Stefan Rümmele, Serge Gaspers, 2018, LATIN.

Planar visibility: testing and counting pdf

Joachim Gudmundsson, Pat Morin, Joachim Gudmundsson, 2010, SCG.

Farthest-polygon Voronoi diagrams

Hazel Everett, Joachim Gudmundsson, Otfried Cheong, 2007, Comput. Geom..

Region-Fault Tolerant Geometric Spanners

Joachim Gudmundsson, Mark de Berg, Mohammad Ali Abam, 2007, SODA '07.

Approximating $(k,\ell)$-center clustering for curves

Joachim Gudmundsson, Maarten Löffler, Kevin Buchin, 2018, 1805.01547.

Barrier Coverage with Uniform Radii in 2D

Joachim Gudmundsson, Julián Mestre, Andrew Cherry, 2017, ALGOSENSORS.

Welfare Maximization in Fractional Hedonic Games

Joachim Gudmundsson, Julián Mestre, Serge Gaspers, 2015, IJCAI.

A Parallel Approximation Algorithm for Minimum Weight Triangulation

Joachim Gudmundsson, Christos Levcopoulos, 1998, Nord. J. Comput..

On R-trees with low query complexity

Joachim Gudmundsson, Mark de Berg, Mark H. Overmars, 2003, Comput. Geom..

Chips on wafers, or packing rectangles into grids

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2005, Comput. Geom..

Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings

Joachim Gudmundsson, C. Barry Jay, 2007, CATS.

Local routing in a tree metric 1-spanner

Joachim Gudmundsson, André van Renssen, Milutin Brankovic, 2020, Journal of Combinatorial Optimization.

Balanced Partition of Minimum Spanning Trees

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2002, Int. J. Comput. Geom. Appl..

Constrained higher order Delaunay triangulations

Joachim Gudmundsson, Marc J. van Kreveld, Herman J. Haverkort, 2005, Comput. Geom..

Of motifs and goals: mining trajectory data

Joachim Gudmundsson, Jan Vahrenhold, Andreas Thom, 2012, SIGSPATIAL/GIS.

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Joachim Gudmundsson, Jan Vahrenhold, Fabian Gieseke, 2010, J. Discrete Algorithms.

A Fast Algorithm for Data Collection along a Fixed Track

Joachim Gudmundsson, Otfried Cheong, Radwa El Shawi, 2013, COCOON.

Approximate one-to-one point pattern matching

Joachim Gudmundsson, Thomas Wolle, Marc Benkert, 2012, J. Discrete Algorithms.

Fast Pruning of Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2005, STACS.

Editorial, SWAT 2008 Special Issue

Joachim Gudmundsson, 2009, Algorithmica.

Box-trees for collision checking in industrial installations

Joachim Gudmundsson, Mark de Berg, Herman J. Haverkort, 2004, Comput. Geom..

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees

Joachim Gudmundsson, Christian Knauer, Michiel Smid, 2016, Int. J. Found. Comput. Sci..

Increasing the readability of graph drawings with centrality-based scaling

Joachim Gudmundsson, Damian Merrick, Joachim Gudmundsson, 2006, APVIS.

Planar Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2016, Encyclopedia of Algorithms.

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs pdf

Joachim Gudmundsson, Fabrizio Frati, William S. Evans, 2013, ISAAC.

A GPU Approach to Subtrajectory Clustering Using the Fréchet Distance

Joachim Gudmundsson, Nacho Valladares, Joachim Gudmundsson, 2012, IEEE Transactions on Parallel and Distributed Systems.

Increasing-Chord Graphs On Point Sets

Joachim Gudmundsson, Fabrizio Frati, Hooman Reisi Dehkordi, 2014, Graph Drawing.

Minimum weight pseudo-triangulations

Joachim Gudmundsson, Christos Levcopoulos, 2007, Comput. Geom..

Schematisation of Tree Drawings

Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick, 2006, Graph Drawing.

Finding the Most Relevant Fragments in Networks

Bettina Speckmann, Joachim Gudmundsson, Maarten Löffler, 2010, J. Graph Algorithms Appl..

Dilation and Detours in Geometric Networks

Joachim Gudmundsson, Christian Knauer, 2007, Handbook of Approximation Algorithms and Metaheuristics.

Planar Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2008, Encyclopedia of Algorithms.

Fast algorithms for approximate Fréchet matching queries in geometric trees

Joachim Gudmundsson, Michiel H. M. Smid, 2015, Comput. Geom..

Networking Self-Organising Maps and Similarity Weight Associations

Joachim Gudmundsson, Younjin Chung, Joachim Gudmundsson, 2019, ICONIP.

Higher Order Delaunay Triangulations

Joachim Gudmundsson, Marc J. van Kreveld, Mikael Hammar, 2000, ESA.

Reporting flock patterns

Joachim Gudmundsson, Thomas Wolle, Florian Hübner, 2006, Comput. Geom..

Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings

Joachim Gudmundsson, C. Barry Jay, 2006, CATS.

A fast algorithm for data collection along a fixed track

Joachim Gudmundsson, Otfried Cheong, Radwa El Shawi, 2014, Theor. Comput. Sci..

Compact Flow Diagrams for State Sequences

Joachim Gudmundsson, Kevin Buchin, Maike Buchin, 2017, ACM J. Exp. Algorithmics.

Quickest Path Queries on Transportation Network

Joachim Gudmundsson, Christos Levcopoulos, Radwa El Shawi, 2012, CATS.

Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword

Joachim Gudmundsson, Michiel Smid, 2020, Comput. Geom..

Local Routing in Sparse and Lightweight Geometric Graphs pdf

Joachim Gudmundsson, Bengt J. Nilsson, Christos Levcopoulos, 2019, ISAAC.

On R-trees with Low Stabbing Number

Joachim Gudmundsson, Mark de Berg, Mark H. Overmars, 2000, ESA.

Detecting Regular Visit Patterns

Joachim Gudmundsson, Thomas Wolle, Bojan Djordjevic, 2009, Algorithmica.

Covering a set of line segments with a few squares

Joachim Gudmundsson, Sampson Wong, Mees van de Kerkhof, 2020 .

Restricted Mesh Simplification Using Edge Contractions

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2009, Int. J. Comput. Geom. Appl..

Fast query structures in anisotropic media

Joachim Gudmundsson, Radwa El Shawi, 2013, Theor. Comput. Sci..

Movement Patterns in Spatio-Temporal Data

Joachim Gudmundsson, Thomas Wolle, Patrick Laube, 2017, Encyclopedia of GIS.

I/O-Efficiently Pruning Dense Spanners

Joachim Gudmundsson, Jan Vahrenhold, Joachim Gudmundsson, 2004, JCDCG.

Theoretical analysis of beaconless geocast protocols in 1D

Joachim Gudmundsson, Maarten Löffler, Irina Kostitsyna, 2018, ANALCO.

Detecting Commuting Patterns by Clustering Subtrajectories

Joachim Gudmundsson, Maarten Löffler, Jun Luo, 2011, Int. J. Comput. Geom. Appl..

Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512)

Joachim Gudmundsson, Patrick Laube, E. Emiel van Loon, 2012, Dagstuhl Reports.

Automated Classification of Passing in Football

Joachim Gudmundsson, Sanjay Chawla, Joël Estephan, 2015, PAKDD.

Experimental algorithms : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014, proceedings

Joachim Gudmundsson, Jyrki Katajainen, 2014 .

Region-restricted clustering for geographic data mining

Joachim Gudmundsson, Giri Narasimhan, Marc J. van Kreveld, 2006, Comput. Geom..

Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

Joachim Gudmundsson, Barry Jay, 2006 .

Facility location and the geometric minimum-diameter spanning tree

Alexander Wolff, Joachim Gudmundsson, Chan-Su Shin, 2002, Computational geometry.

Fast fréchet distance between curves with long edges

Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, 2018, IWISC.

Finding Popular Places

Joachim Gudmundsson, Thomas Wolle, Marc Benkert, 2007, Int. J. Comput. Geom. Appl..

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

Alexander Wolff, Joachim Gudmundsson, Christian Knauer, 2006, COCOON.

Higher order Delaunay triangulations

Joachim Gudmundsson, Marc J. van Kreveld, Mikael Hammar, 2000, Comput. Geom..

Turbocharging Treewidth Heuristics

Joachim Gudmundsson, Stefan Rümmele, Mitchell Jones, 2016, IPEC.

Measuring the Similarity of Geometric Graphs

Joachim Gudmundsson, Otfried Cheong, Hyo-Sil Kim, 2009, SEA.

A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns

Joachim Gudmundsson, Masahiro Takatsuka, Younjin Chung, 2017, ICONIP.

A Generalization of the Convex Kakeya Problem

Sang Won Bae, Joachim Gudmundsson, Otfried Cheong, 2013, Algorithmica.

Approximate Distance Oracles for Graphs with Dense Clusters

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2004, ISAAC.

Detecting Regular Visit Patterns

Joachim Gudmundsson, Thomas Wolle, Bojan Djordjevic, 2008, ESA.

Algorithms for Marketing-Mix Optimization

Joachim Gudmundsson, Michiel H. M. Smid, Pat Morin, 2010, Algorithmica.

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2002, SIAM J. Comput..

Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51

Joachim Gudmundsson, Barry Jay, 2006 .

Quickest Paths in Anisotropic Media

Joachim Gudmundsson, Radwa El Shawi, 2011, COCOA.

Reporting flock patterns

Joachim Gudmundsson, Thomas Wolle, Florian Hübner, 2008, Comput. Geom..

Dimensionality reduction for long duration and complex spatio-temporal queries

Joachim Gudmundsson, Sanjay Chawla, Ghazi Al-Naymat, 2007, SAC '07.

Some) Techniques for Handling Massive Data Sets

Joachim Gudmundsson, Jan Vahrenhold, Lars Arge, 2007 .

On beta-Plurality Points in Spatial Voting Games

Joachim Gudmundsson, Boris Aronov, Mark de Berg, 2020, SoCG.

Computational Aspects of Multi-Winner Approval Voting

Joachim Gudmundsson, Toby Walsh, Nicholas Mattei, 2014, MPREF@AAAI.

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs

Joachim Gudmundsson, Fabrizio Frati, William S. Evans, 2016, J. Graph Theory.

Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006

Alexander Wolff, Joachim Gudmundsson, Giri Narasimhan, 2007, Geometric Networks and Metric Space Embeddings.

A simple and efficient kinetic spanner

Joachim Gudmundsson, Mark de Berg, Mohammad Ali Abam, 2010, Comput. Geom..

Detecting Commuting Patterns by Clustering Subtrajectories

Joachim Gudmundsson, Maarten Löffler, Jun Luo, 2008, Int. J. Comput. Geom. Appl..

Compact Flow Diagrams for State Sequences

Joachim Gudmundsson, Kevin Buchin, Maike Buchin, 2016, SEA.

Approximate distance oracles for graphs with dense clusters

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2007, Comput. Geom..

Constructing Plane Spanners of Bounded Degree and Low Weight

Joachim Gudmundsson, Michiel H. M. Smid, Prosenjit Bose, 2005, Algorithmica.

Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons

Joachim Gudmundsson, Rasmus Pagh, 2017, ISAAC.

Abstracts for the twentyfirst European workshop on Computational geometry, Technische Universiteit Eindhoven, The Netherlands, March 9-11, 2005

Bettina Speckmann, Joachim Gudmundsson, de Mt Mark Berg, 2005 .

Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings

Joachim Gudmundsson, 2008, SWAT.

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

Alexander Wolff, Joachim Gudmundsson, Christian Knauer, 2009, Int. J. Comput. Geom. Appl..

Constructing minimum-interference networks

Alexander Wolff, Joachim Gudmundsson, Herman J. Haverkort, 2008, Comput. Geom..

Reporting Leaders and Followers among Trajectories of Moving Point Objects

Joachim Gudmundsson, Thomas Wolle, Mattias Andersson, 2008, GeoInformatica.

Bounded-degree light approximate shortest-path trees in doubling metrics

Joachim Gudmundsson, Julián Mestre, Seeun William Umboh, 2021, Discret. Appl. Math..

Improving the dilation of a metric graph by adding edges

Joachim Gudmundsson, Sampson Wong, 2021, SODA.

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size pdf

Joachim Gudmundsson, Sampson Wong, Martin P. Seybold, 2021, ArXiv.

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures pdf

Joachim Gudmundsson, Martin P. Seybold, 2022, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

Local routing in a tree metric 1-spanner

Joachim Gudmundsson, André van Renssen, Milutin Brankovic, 2021, Journal of Combinatorial Optimization.

Augmenting Graphs to Minimize the Radius

Joachim Gudmundsson, Yuan Sha, Fan Yao, 2021, ISAAC.

Translation Invariant Fr\'echet Distance Queries

Joachim Gudmundsson, Sampson Wong, Andr'e van Renssen, 2021 .

Algorithms for Radius-Optimally Augmenting Trees in a Metric Space

Joachim Gudmundsson, Yuan Sha, 2021, WADS.

Restricted mesh simplification using edge contractions

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2006 .

Approximating $(k,\ell)$-center clustering for curves

Joachim Gudmundsson, Maarten Löffler, Kevin Buchin, 2018 .

Hardness Result for TSP with Neighborhoods

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 2000 .