Advanced search

Loading...

Advanced search    

Search: authors:"Wolfgang Mulzer"

11 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Stabbing Pairwise Intersecting Disks by Five Points

Wolfgang Mulzer 2 Institut für Informatik, Freie Universität Berlin , 14195 Berlin, Germany https://orcid.org/0000-0002-1948-5840 3 Haim Kaplan School of Computer Science, Tel Aviv University , Tel Aviv

Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance

Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One popular measure is the Fréchet distance. Since it was proposed by Alt and Godau in 1992, many variants and extensions have been studied. Nonetheless, even more than 20 years later, the original \(O(n^2 \log n)\) algorithm by Alt and Godau for computing the Fréchet...

Routing in Polygonal Domains

Numerical Mathematics , 27 ( 4 ): 458 - 473 , 1987 . Haim Kaplan , Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Routing in unit disk graphs . In Proc. 12th LATIN , pages 536 - 548 , 2016 . Sanjiv Kapoor

Improved Time-Space Trade-Offs for Computing Voronoi Diagrams

for all-nearest-larger-neighbors problems . In Proc. 13th Int. Symp. Algorithms and Data Structures (WADS) , pages 61 - 72 , 2013 . Tetsuo Asano , Wolfgang Mulzer, G?nter Rote, and Yajun Wang . Constant ... -work-space algorithms for geometric problems . J. of Comput. Geom. , 2 ( 1 ): 46 - 68 , 2011 . Tetsuo Asano , Wolfgang Mulzer, and Yajun Wang . Constant-work-space algorithms for shortest paths in trees

Approximability of the Discrete Fr\'echet Distance

S o C G ' Approximability of the Discrete Fréchet Distance Karl Bringmann 0 Wolfgang Mulzer 0 0 Institute of Theoretical Computer Science, ETH Zurich, Switzerland Institut für Informatik, Freie ... matching conditional lower bounds . arXiv:1408.1340 , 2014 . Kevin Buchin , Maike Buchin, Wouter Meulemans, and Wolfgang Mulzer . Four soviets walk the dog - with an application to Alt's conjecture . In Proc

Computational Aspects of the Colorful Carath\'eodory Theorem

S o C G ' Computational Aspects of the Colorful Carath?odory Theorem Wolfgang Mulzer Yannik Stein Institut f?r Informatik Freie Universit?t Berlin Germany mulzer yannikstein}@inf.fu-berlin.de Let ... . Springer, Berlin, 2007 . Geom. , 43 ( 8 ): 647 - 654 , 2010 . Wolfgang Mulzer and Daniel Werner . Approximating Tverberg points in linear time for any fixed dimension . Discrete Comput. Geom. , 50 ( 2 ): 520

Approximability of the Discrete Fr\'echet Distance

S o C G ' Approximability of the Discrete Fr?chet Distance Karl Bringmann 0 Wolfgang Mulzer 0 0 Institute of Theoretical Computer Science, ETH Zurich, Switzerland Institut fu?r Informatik, Freie ... conditional lower bounds . arXiv:1408.1340 , 2014 . Kevin Buchin , Maike Buchin, Wouter Meulemans, and Wolfgang Mulzer . Four soviets walk the dog - with an application to Alt's conjecture . In Proc. 25th Annu

Approximability of the Discrete Fr\'echet Distance

S o C G ' Approximability of the Discrete Fr?chet Distance Karl Bringmann 0 Wolfgang Mulzer 0 0 Institute of Theoretical Computer Science, ETH Zurich, Switzerland Institut fu?r Informatik, Freie ... conditional lower bounds . arXiv:1408.1340 , 2014 . Kevin Buchin , Maike Buchin, Wouter Meulemans, and Wolfgang Mulzer . Four soviets walk the dog - with an application to Alt's conjecture . In Proc. 25th Annu

Computing the Fréchet Distance with a Retractable Leash

All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fréchet...

Spanners and Reachability Oracles for Directed Transmission Graphs

Let P be a set of n points in d dimensions, each with an associated radius r_p > 0. The transmission graph G for P has vertex set P and an edge from p to q if and only if q lies in the ball with radius r_p around p. Let t > 1. A t-spanner H for G is a sparse subgraph of G such that for any two vertices p, q connected by a path of length l in G, there is a p-q-path of length at...

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended

Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection ℛ of input regions known in advance. Building on recent work by Löffler and Snoeyink, we show how to leverage our knowledge of ℛ for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, e.g., overlapping disks...