The following pages link to Wolfgang Mulzer (Q312141):
Displaying 50 items.
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Routing in histograms (Q782155) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- A note on predecessor searching in the pointer machine model (Q989469) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing (Q1940703) (← links)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
- No-dimensional Tverberg theorems and algorithms (Q2105318) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- Recognizing generalized transmission graphs of line segments and circular sectors (Q2294728) (← links)
- A constructive proof of a concentration bound for real-valued random variables (Q2308463) (← links)
- Reachability oracles for directed transmission graphs (Q2309470) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Data structures on event graphs (Q2350906) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Delta-fast tries: local searches in bounded universes with linear space (Q2405298) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition (Q2842184) (← links)
- Computing the Fréchet Distance with a Retractable Leash (Q2849314) (← links)
- Vertex Deletion for 3D Delaunay Triangulations (Q2849315) (← links)
- Constant-work-space algorithms for shortest paths in trees and simple polygons (Q2865044) (← links)
- Algorithms for Tolerated Tverberg Partitions (Q2872094) (← links)
- Self-improving algorithms for coordinate-wise maxima (Q2874589) (← links)
- (Q2968076) (← links)
- Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition (Q2968106) (← links)
- Approximability of the discrete Fréchet distance (Q2970465) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
- Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more (Q3016253) (← links)
- Self-Improving Algorithms (Q3020010) (← links)
- Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent (Q3143298) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in Doubling Metrics (Q3387270) (← links)
- Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon (Q3404425) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q3459888) (← links)
- Minimum-weight triangulation is NP-hard (Q3546362) (← links)
- (Q3601515) (← links)
- The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications (Q4575830) (← links)
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications (Q4575914) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
