default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaarten Löffler
Person information
- affiliation: Utrecht University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Elena Arseneva
, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. Discret. Comput. Geom. 71(4): 1429-1455 (2024)- [j68]Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler, Clément Maria, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Jonathan Spreer:
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024) - [c120]Maarten Löffler:
The Algorithm Experience at Primary Schools: An Experience Report. CMSC 2024: 104-114 - [c119]Marjolein Haagsman, Maarten Löffler, Carola Wenk:
Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition). SoCG 2024: 88:1-88:4 - [c118]Maarten Löffler:
Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area (Poster Abstract). GD 2024: 47:1-47:3 - [c117]Stephane Durocher, Myroslav Kryven, Maarten Löffler:
String Graph with Cop Number 4 (Poster Abstract). GD 2024: 53:1-53:3 - [i80]Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec, Jules Wulms:
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4. CoRR abs/2402.12357 (2024) - 2023
- [j67]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2(1): 5:1-5:18 (2023) - [j66]Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. Comput. Geom. Topol. 2(1): 6:1-6:28 (2023) - [j65]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom. 109: 101923 (2023) - [j64]Erik D. Demaine, Maarten Löffler, Christiane Schmidt:
Rectangular Spiral Galaxies are still hard. Comput. Geom. 110: 101949 (2023) - [j63]Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen:
Fréchet Distance for Uncertain Curves. ACM Trans. Algorithms 19(3): 29:1-29:47 (2023) - [c116]Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms:
The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI 2023: 8343-8350 - [c115]Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, Frank Staals:
Shortest Paths in Portalgons. SoCG 2023: 48:1-48:16 - [c114]Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. GD (2) 2023: 18-33 - [c113]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. SOFSEM 2023: 80-95 - [i79]Maarten Löffler, Tim Ophelders, Frank Staals, Rodrigo I. Silveira:
Shortest Paths in Portalgons. CoRR abs/2303.08937 (2023) - [i78]Siu-Wing Cheng, Maarten Löffler, Jeff M. Phillips, Aleksandr Popov:
Computational Geometry (Dagstuhl Seminar 23221). Dagstuhl Reports 13(5): 165-181 (2023) - 2022
- [j62]Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. Graphs Comb. 38(5): 155 (2022) - [j61]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum color spanning circle of imprecise points. Theor. Comput. Sci. 930: 116-127 (2022) - [c112]Davide Dell'Anna, Natasha Alechina, Fabiano Dalpiaz, Mehdi Dastani, Maarten Löffler, Brian Logan:
The Complexity of Norm Synthesis and Revision. COINE 2022: 38-53 - [c111]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. SoCG 2022: 2:1-2:14 - [c110]Thijs van der Horst, Maarten Löffler, Frank Staals:
Chromatic k-Nearest Neighbor Queries. ESA 2022: 67:1-67:14 - [c109]Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. FUN 2022: 1:1-1:21 - [c108]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. ISAAC 2022: 34:1-34:14 - [c107]Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. ISAAC 2022: 58:1-58:16 - [c106]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Imprecise Points for the Pareto Front. SODA 2022: 3144-3167 - [c105]Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. SWAT 2022: 21:1-21:16 - [i77]Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. CoRR abs/2201.03490 (2022) - [i76]Eva-Maria Hainzl, Maarten Löffler, Daniel Perz, Josef Tkadlec, Markus Wallinger:
Finding a Battleship of Uncertain Shape. CoRR abs/2202.08747 (2022) - [i75]Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber:
Flipping Plane Spanning Paths. CoRR abs/2202.10831 (2022) - [i74]Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. CoRR abs/2202.12045 (2022) - [i73]Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. CoRR abs/2202.12175 (2022) - [i72]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. CoRR abs/2203.07280 (2022) - [i71]Thijs van der Horst, Maarten Löffler, Frank Staals:
Chromatic k-Nearest Neighbor Queries. CoRR abs/2205.00277 (2022) - [i70]Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms:
The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR abs/2205.07756 (2022) - [i69]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum color spanning circle of imprecise points. CoRR abs/2208.13865 (2022) - [i68]Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. CoRR abs/2209.02103 (2022) - [i67]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. CoRR abs/2209.14804 (2022) - [i66]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. CoRR abs/2210.05384 (2022) - [i65]Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber:
Blocking Delaunay Triangulations from the Exterior. CoRR abs/2210.12015 (2022) - 2021
- [j60]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding polyominoes with holes into a cube. Comput. Geom. 93: 101700 (2021) - [j59]Vahideh Keikha, Maarten Löffler, Ali Mohades:
Largest and smallest area triangles on imprecise points. Comput. Geom. 95: 101742 (2021) - [j58]Fabian Klute, Maarten Löffler, Martin Nöllenburg:
Labeling nonograms: Boundary labeling for curve arrangements. Comput. Geom. 98: 101791 (2021) - [c104]Maarten Löffler, Jérôme Urhausen:
Mapping Points to the Grid with Bounded Hausdor Distance. CCCG 2021: 47-55 - [c103]Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum Color Spanning Circle in Imprecise Setup. COCOON 2021: 257-268 - [c102]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG 2021: 5:1-5:19 - [c101]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17 - [c100]Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg:
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. GD 2021: 304-317 - [c99]Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler:
Embedding Ray Intersection Graphs and Global Curve Simplification. GD 2021: 358-371 - [c98]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. GIScience (II) 2021: 10:1-10:16 - [c97]Kevin Buchin, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen:
Uncertain Curve Simplification. MFCS 2021: 26:1-26:22 - [c96]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. WADS 2021: 243-257 - [c95]Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen:
Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. WADS 2021: 627-640 - [c94]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR 2021: 107-123 - [i64]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Imprecise Points for the Pareto Front. CoRR abs/2101.06079 (2021) - [i63]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary:
Terrain prickliness: theoretical grounds for low complexity viewsheds. CoRR abs/2103.06696 (2021) - [i62]Kevin Buchin, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen:
Uncertain Curve Simplification. CoRR abs/2103.09223 (2021) - [i61]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021) - [i60]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR abs/2103.09811 (2021) - [i59]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. CoRR abs/2105.09922 (2021) - [i58]Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler:
Embedding Ray Intersection Graphs and Global Curve Simplification. CoRR abs/2109.00042 (2021) - [i57]Erik D. Demaine, Maarten Löffler, Christiane Schmidt:
Rectangular Spiral Galaxies are Still Hard. CoRR abs/2110.00058 (2021) - [i56]Davide Dell'Anna, Natasha Alechina, Brian Logan, Maarten Löffler, Fabiano Dalpiaz, Mehdi Dastani:
The Complexity of Data-Driven Norm Synthesis and Revision. CoRR abs/2112.02626 (2021) - 2020
- [j57]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64(3): 575-607 (2020) - [j56]Ivor van der Hoog, Vahideh Keikha, Maarten Löffler, Ali Mohades, Jérôme Urhausen:
Maximum-area triangle in a convex polygon, revisited. Inf. Process. Lett. 161: 105943 (2020) - [j55]Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On optimal polyline simplification using the Hausdorff and Fréchet distance. J. Comput. Geom. 11(1): 1-25 (2020) - [j54]Vahideh Keikha, Maarten Löffler, Ali Mohades:
A fully polynomial time approximation scheme for the smallest diameter of imprecise points. Theor. Comput. Sci. 814: 259-270 (2020) - [j53]Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-colored spanning graphs. Theor. Comput. Sci. 833: 11-25 (2020) - [c93]Mees van de Kerkhof, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler, Tim Ophelders:
Route-preserving Road Network Generalization. SIGSPATIAL/GIS 2020: 381-384 - [c92]Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen:
Fréchet Distance for Uncertain Curves. ICALP 2020: 20:1-20:20 - [c91]Patrick Eades, Ivor van der Hoog, Maarten Löffler, Frank Staals:
Trajectory Visibility. SWAT 2020: 23:1-23:22 - [i55]Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen:
Fréchet Distance for Uncertain Curves. CoRR abs/2004.11862 (2020) - [i54]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. CoRR abs/2005.02530 (2020)
2010 – 2019
- 2019
- [j52]Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira:
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles). Algorithmica 81(7): 2682-2715 (2019) - [j51]Mees van de Kerkhof, Tim de Jong, Raphael Parment, Maarten Löffler, Amir Vaxman, Marc J. van Kreveld:
Design and Automated Generation of Japanese Picture Puzzles. Comput. Graph. Forum 38(2): 343-353 (2019) - [j50]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi drawings of knots and links. J. Comput. Geom. 10(1): 444-476 (2019) - [c90]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CCCG 2019: 164-170 - [c89]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Ambiguous Imprecise Points. SoCG 2019: 42:1-42:16 - [c88]Maarten Löffler:
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition). SoCG 2019: 65:1-65:2 - [c87]Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk:
Global Curve Simplification. ESA 2019: 67:1-67:14 - [c86]Lionov Wiratma, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
An Experimental Evaluation of Grouping Definitions for Moving Entities. SIGSPATIAL/GIS 2019: 89-98 - [c85]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. ICALP 2019: 9:1-9:15 - [c84]Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, Martijn Struijs:
Approximating (k, ℓ)-center clustering for curves. SODA 2019: 2922-2938 - [c83]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
Most Vital Segment Barriers. WADS 2019: 495-509 - [i53]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. CoRR abs/1902.04045 (2019) - [i52]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Ambiguous Imprecise Points. CoRR abs/1903.08280 (2019) - [i51]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
Most vital segment barriers. CoRR abs/1905.01185 (2019) - [i50]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CoRR abs/1910.09917 (2019) - [i49]Maarten Löffler, Anna Lubiw, Saul Schleimer, Erin Wolf Chambers:
Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352). Dagstuhl Reports 9(8): 84-112 (2019) - 2018
- [j49]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored spanning graphs for set visualization. Comput. Geom. 68: 262-276 (2018) - [j48]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the complexity of barrier resilience for fat regions and bounded ply. Comput. Geom. 72: 34-51 (2018) - [j47]Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and Its Computation. Int. J. Comput. Geom. Appl. 28(2): 181-196 (2018) - [j46]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg:
Planar and poly-arc Lombardi drawings. J. Comput. Geom. 9(1): 328-355 (2018) - [c82]Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler, Tobias Müller, Vera Sacristán, Rodrigo I. Silveira:
Theoretical analysis of beaconless geocast protocols in 1D. ANALCO 2018: 62-76 - [c81]Vahideh Keikha, Maarten Löffler, Ali Mohades, Zahed Rahmati:
Width and Bounding Box of Imprecise Points. CCCG 2018: 142-148 - [c80]Ivor van der Hoog, Elena Khramtcova, Maarten Löffler:
Dynamic Smooth Compressed Quadtrees. SoCG 2018: 45:1-45:15 - [c79]Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance. SoCG 2018: 56:1-56:14 - [c78]Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. GD 2018: 361-367 - [c77]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2018: 609-617 - [c76]Lionov Wiratma, Maarten Löffler, Frank Staals:
An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper). GIScience 2018: 64:1-64:6 - [c75]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex Partial Transversals of Planar Regions. ISAAC 2018: 52:1-52:12 - [i48]Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance. CoRR abs/1803.03550 (2018) - [i47]Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler:
Approximating (k, 𝓁)-center clustering for curves. CoRR abs/1805.01547 (2018) - [i46]Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. CoRR abs/1808.10572 (2018) - [i45]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex partial transversals of planar regions. CoRR abs/1809.10078 (2018) - [i44]Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk:
On Optimal Min-# Curve Simplification Problem. CoRR abs/1809.10269 (2018) - 2017
- [j45]Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl:
Packing plane spanning trees and paths in complete geometric graphs. Inf. Process. Lett. 124: 35-41 (2017) - [j44]Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Central trajectories. J. Comput. Geom. 8(1): 366-386 (2017) - [j43]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the complexity of minimum-link path problems. J. Comput. Geom. 8(2): 80-108 (2017) - [j42]Arthur van Goethem, Frank Staals, Maarten Löffler, Jason Dykes, Bettina Speckmann:
Multi-Granular Trend Detection for Time-Series Analysis. IEEE Trans. Vis. Comput. Graph. 23(1): 661-670 (2017) - [c74]Lionov Wiratma, Marc J. van Kreveld, Maarten Löffler:
On Measures for Groups of Trajectories. AGILE Conf. 2017: 311-330 - [c73]Maarten Löffler, Wouter Meulemans:
Discretized Approaches to Schematization. CCCG 2017: 220-225 - [c72]Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada:
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). SoCG 2017: 64:1-64:5 - [c71]Elena Khramtcova, Maarten Löffler:
Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals. CSR 2017: 176-190 - [c70]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. GD 2017: 113-126 - [c69]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2017: 575-582 - [c68]Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow:
Obedient Plane Drawings for Disk Intersection Graphs. WADS 2017: 73-84 - [i43]Vahideh Keikha, Maarten Löffler, Jérôme Urhausen, Ivor van der Hoog:
Maximum-Area Triangle in a Convex Polygon, Revisited. CoRR abs/1705.11035 (2017) - [i42]Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl:
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CoRR abs/1707.05440 (2017) - [i41]Vahideh Keikha, Maarten Löffler, Ali Mohades, Ivor van der Hoog:
Maximum-Area Quadrilateral in a Convex Polygon, Revisited. CoRR abs/1708.00681 (2017) - [i40]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. CoRR abs/1708.09819 (2017) - [i39]Ivor van der Hoog, Elena Khramtcova, Maarten Löffler:
Dynamic smooth compressed quadtrees (Fullversion). CoRR abs/1712.05591 (2017) - [i38]Vahideh Keikha, Maarten Löffler, Ali Mohades:
Largest and Smallest Area Triangles on a Given Set of Imprecise Points. CoRR abs/1712.08911 (2017) - [i37]Benjamin A. Burton, Maarten Löffler, Carola Wenk, Erin Wolf Chambers:
Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072). Dagstuhl Reports 7(2): 64-88 (2017) - 2016
- [j41]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j40]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. Graphs Comb. 32(3): 923-942 (2016) - [j39]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict confluent drawing. J. Comput. Geom. 7(1): 22-46 (2016) - [j38]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-preserving spatial treemaps. J. Comput. Geom. 7(1): 100-122 (2016) - [j37]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. J. Spatial Inf. Sci. 13(1): 3-32 (2016) - [j36]William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Minimizing Co-location Potential of Moving Entities. SIAM J. Comput. 45(5): 1870-1893 (2016) - [j35]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories on Nonmonotone Criteria. ACM Trans. Algorithms 12(2): 26:1-26:28 (2016) - [c67]Ingo van Duijn, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler:
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. CCCG 2016: 208-215 - [c66]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the Complexity of Minimum-Link Path Problems. SoCG 2016: 49:1-49:16 - [c65]Arthur van Goethem, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Grouping Time-Varying Data for Interactive Exploration. SoCG 2016: 61:1-61:16 - [c64]Erin W. Chambers, Irina Kostitsyna, Maarten Löffler, Frank Staals:
Homotopy Measures for Representative Trajectories. ESA 2016: 27:1-27:17 - [c63]William S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk:
Recognizing a DOG is Hard, But Not When It is Thin and Unit. FUN 2016: 16:1-16:12 - [c62]Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-colored Spanning Graphs. GD 2016: 81-93 - [c61]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2016: 589-595 - [c60]Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and its Computation. ISAAC 2016: 48:1-48:12 - [r1]Marc J. van Kreveld, Maarten Löffler:
Range Searching. Encyclopedia of Algorithms 2016: 1767-1771 - [i36]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored Spanning Graphs for Set Visualization. CoRR abs/1603.00580 (2016) - [i35]Arthur van Goethem, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Grouping Time-varying Data for Interactive Exploration. CoRR abs/1603.06252 (2016) - [i34]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the complexity of minimum-link path problems. CoRR abs/1603.06972 (2016) - [i33]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - [i32]Ingo van Duijn, Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler:
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. CoRR abs/1607.05347 (2016) - [i31]Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-Colored Spanning Graphs. CoRR abs/1608.07056 (2016) - [i30]Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Space-Efficient Hidden Surface Removal. CoRR abs/1611.06915 (2016) - 2015
- [j34]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk:
Optimizing airspace closure with respect to politicians' egos. Theor. Comput. Sci. 586: 161-175 (2015) - [c59]Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira:
Region-based Approximation Algorithms for Visibility between Imprecise Locations. ALENEX 2015: 94-103 - [c58]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CIAC 2015: 339-351 - [c57]Marc J. van Kreveld, Maarten Löffler, Paul Mutser:
Automated puzzle difficulty estimation. CIG 2015: 415-422 - [c56]Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structure under Geodesic Distance. SoCG 2015: 674-688 - [c55]Maarten Löffler, Csaba D. Tóth:
Linear-Size Universal Point Sets for One-Bend Drawings. GD 2015: 423-429 - [c54]Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, Csaba D. Tóth:
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. GD 2015: 447-459 - [c53]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2015: 531-537 - [c52]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - [i29]Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Central Trajectories. CoRR abs/1501.01822 (2015) - [i28]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CoRR abs/1501.06813 (2015) - 2014
- [j33]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Visibility with Multiple Viewpoints. Int. J. Comput. Geom. Appl. 24(4): 275-306 (2014) - [j32]Maarten Löffler, Wolfgang Mulzer:
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition. J. Comput. Geom. 5(1): 1-13 (2014) - [j31]Maarten Löffler, Mira Kaiser, Tim van Kapel, Gerwin Klappe, Marc J. van Kreveld, Frank Staals:
The Connect-The-Dots family of puzzles: design and automatic generation. ACM Trans. Graph. 33(4): 72:1-72:10 (2014) - [c51]Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl:
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CCCG 2014 - [c50]Mira Kaiser, Tim van Kapel, Gerwin Klappe, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
The Connect-The-Dots Family of Puzzles: The Video. SoCG 2014: 85 - [c49]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk:
Optimizing Airspace Closure with Respect to Politicians' Egos. FUN 2014: 264-276 - [c48]Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2014: 501-506 - [c47]Frank Kammer, Maarten Löffler, Paul Mutser, Frank Staals:
Practical Approaches to Partially Guarding a Polyhedral Terrain. GIScience 2014: 318-332 - [c46]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. LATIN 2014: 478-489 - [i27]Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira:
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles). CoRR abs/1402.5681 (2014) - [i26]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CoRR abs/1410.1579 (2014) - 2013
- [j30]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma:
Median Trajectories. Algorithmica 66(3): 595-614 (2013) - [j29]David Eppstein, Maarten Löffler:
Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. Discret. Comput. Geom. 50(1): 1-21 (2013) - [j28]David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM J. Exp. Algorithmics 18 (2013) - [j27]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. 17(3): 173-200 (2013) - [j26]Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira:
Flow computations on imprecise terrains. J. Comput. Geom. 4(1): 38-78 (2013) - [j25]Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Computing Correlation between Piecewise-Linear Functions. SIAM J. Comput. 42(5): 1867-1887 (2013) - [j24]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-based routing in social networks: Membership dimension and the small-world phenomenon. Theor. Comput. Sci. 514: 96-104 (2013) - [c45]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the Complexity of Barrier Resilience for Fat Regions. ALGOSENSORS 2013: 201-216 - [c44]Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CCCG 2013 - [c43]William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Competitive query strategies for minimising the ply of the potential locations of moving points. SoCG 2013: 155-164 - [c42]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán Adinolfi, Rodrigo I. Silveira, Bettina Speckmann:
Colored Spanning Graphs for Set Visualization. GD 2013: 280-291 - [c41]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. GD 2013: 352-363 - [c40]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Visibility with Multiple Viewpoints. ISAAC 2013: 317-327 - [c39]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911 - [c38]Maarten Löffler, Wolfgang Mulzer:
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition. WADS 2013: 487-498 - [c37]Maarten Löffler, Joseph A. Simons, Darren Strash:
Dynamic Planar Point Location with Sub-logarithmic Local Updates. WADS 2013: 499-511 - [i25]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the Complexity of Barrier Resilience for Fat Regions. CoRR abs/1302.4707 (2013) - [i24]Maarten Löffler, Wolfgang Mulzer:
Unions of Onions. CoRR abs/1302.5328 (2013) - [i23]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. CoRR abs/1308.6824 (2013) - [i22]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán Adinolfi, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain visibility with multiple viewpoints. CoRR abs/1309.4323 (2013) - [i21]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. CoRR abs/1312.4429 (2013) - 2012
- [j23]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Removing local extrema from imprecise terrains. Comput. Geom. 45(7): 334-349 (2012) - [j22]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira:
Processing aggregated data: the location of clusters in health data. GeoInformatica 16(3): 497-521 (2012) - [j21]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. 16(2): 243-259 (2012) - [j20]Maarten Löffler, Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. SIAM J. Comput. 41(4): 941-974 (2012) - [c36]Maarten Löffler, Martin Nöllenburg:
Planar Lombardi Drawings of Outerpaths. GD 2012: 561-562 - [c35]Marc J. van Kreveld, Maarten Löffler, János Pach:
How Many Potatoes Are in a Mesh? ISAAC 2012: 166-176 - [i20]Maarten Löffler, Joseph A. Simons, Darren Strash:
Dynamic Planar Point Location with Sub-Logarithmic Local Updates. CoRR abs/1204.4714 (2012) - [i19]Allan Jørgensen, Maarten Löffler, Jeff M. Phillips:
Geometric Computations on Indecisive and Uncertain Points. CoRR abs/1205.0273 (2012) - [i18]Maarten Löffler, Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. CoRR abs/1205.4738 (2012) - [i17]Marc J. van Kreveld, Maarten Löffler, János Pach:
How Many Potatoes are in a Mesh? CoRR abs/1209.3954 (2012) - 2011
- [j19]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011) - [j18]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer:
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. Algorithmica 61(3): 674-693 (2011) - [j17]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011) - [j16]Maarten Löffler:
Existence and Computation of Tours through Imprecise Points. Int. J. Comput. Geom. Appl. 21(1): 1-24 (2011) - [j15]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo:
Detecting Commuting Patterns by Clustering Subtrajectories. Int. J. Comput. Geom. Appl. 21(3): 253-282 (2011) - [j14]Maarten Löffler, Elena Mumford:
Connected Rectilinear Graphs on Point Sets. J. Comput. Geom. 2(1): 1-15 (2011) - [j13]Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann:
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3(1): 3-31 (2011) - [j12]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. Theor. Comput. Sci. 412(32): 4173-4186 (2011) - [c34]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN 2011: 102-107 - [c33]David Eppstein, Maarten Löffler:
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. SCG 2011: 361-369 - [c32]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler:
Planar and Poly-arc Lombardi Drawings. GD 2011: 308-319 - [c31]Maarten Löffler, Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. SODA 2011: 1759-1777 - [c30]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170 - [c29]Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira:
Flow Computations on Imprecise Terrains. WADS 2011: 350-361 - [c28]David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. WADS 2011: 362-373 - [c27]Allan Jørgensen, Maarten Löffler, Jeff M. Phillips:
Geometric Computations on Indecisive Points. WADS 2011: 536-547 - [i16]David Eppstein, Maarten Löffler:
Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. CoRR abs/1103.2575 (2011) - [i15]David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. CoRR abs/1105.0392 (2011) - [i14]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. CoRR abs/1105.0398 (2011) - [i13]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). CoRR abs/1108.4675 (2011) - [i12]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler:
Planar and Poly-Arc Lombardi Drawings. CoRR abs/1109.0345 (2011) - [i11]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). CoRR abs/1110.4499 (2011) - [i10]Anne Driemel, Herman J. Haverkort, Maarten Löffler:
Flow Computations on Imprecise Terrains. CoRR abs/1111.1651 (2011) - 2010
- [j11]Maarten Löffler, Marc J. van Kreveld:
Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica 56(2): 235-269 (2010) - [j10]Maarten Löffler, Jack Snoeyink:
Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geom. 43(3): 234-242 (2010) - [j9]Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Optimization for first order Delaunay triangulations. Comput. Geom. 43(4): 377-394 (2010) - [j8]Maarten Löffler, Marc J. van Kreveld:
Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. 43(4): 419-433 (2010) - [j7]Chris Gray, Maarten Löffler, Rodrigo I. Silveira:
Smoothing Imprecise 1.5D Terrains. Int. J. Comput. Geom. Appl. 20(4): 381-414 (2010) - [j6]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [j5]Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell:
Preprocessing Imprecise Points and Splitting Triangulations. SIAM J. Comput. 39(7): 2990-3000 (2010) - [c26]Maarten Löffler, Martin Nöllenburg:
Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. CCCG 2010: 203-206 - [c25]Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Computing similarity between piecewise-linear functions. SCG 2010: 375-383 - [c24]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma:
Median Trajectories. ESA (1) 2010: 463-474 - [c23]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD 2010: 129-140 - [c22]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. GD 2010: 208-219 - [c21]David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) 2010: 403-414 - [i9]David Eppstein, Maarten Löffler, Darren Strash:
Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems 2010 - [i8]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Removing Local Extrema from Imprecise Terrains. CoRR abs/1002.2580 (2010) - [i7]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The dilation of the Delaunay triangulation is greater than π/2. CoRR abs/1006.0291 (2010) - [i6]David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. CoRR abs/1006.5440 (2010) - [i5]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. CoRR abs/1009.0045 (2010) - [i4]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. CoRR abs/1009.0088 (2010)
2000 – 2009
- 2009
- [b1]Maarten Löffler:
Data Imprecision in Computational Geometry. Utrecht University, Netherlands, 2009 - [j4]Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler:
Polychromatic 4-coloring of guillotine subdivisions. Inf. Process. Lett. 109(13): 690-694 (2009) - [j3]Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi:
Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4): 469-478 (2009) - [c20]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c19]Chris Gray, Maarten Löffler, Rodrigo I. Silveira:
Minimizing Slope Change in Imprecise 1.5D terrains. CCCG 2009: 55-58 - [c18]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG 2009: 165-167 - [c17]Maarten Löffler, Jeff M. Phillips:
Shape Fitting on Point Sets with Probability Distributions. ESA 2009: 313-324 - [c16]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The Directed Hausdorff Distance between Imprecise Point Sets. ISAAC 2009: 720-729 - [c15]Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann:
Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 - [c14]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer:
Delaunay Triangulation of Imprecise Points Simplified and Extended. WADS 2009: 131-143 - [i3]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. CoRR abs/0909.4642 (2009) - 2008
- [j2]Marc J. van Kreveld, Maarten Löffler:
Approximating largest convex hulls for imprecise points. J. Discrete Algorithms 6(4): 583-594 (2008) - [c13]Maarten Löffler, Jack Snoeyink:
Delaunay triangulations of imprecise pointsin linear time after preprocessing. SCG 2008: 298-304 - [c12]Maarten Löffler, Elena Mumford:
Connected Rectilinear Graphs on Point Sets. GD 2008: 313-318 - [c11]Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann:
Feed-links for network extensions. GIS 2008: 35 - [c10]Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell:
Preprocessing Imprecise Points and Splitting Triangulations. ISAAC 2008: 544-555 - [c9]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo:
Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655 - [c8]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira:
Clusters in Aggregated Health Data. SDH 2008: 77-90 - [c7]Chris Gray, Maarten Löffler, Rodrigo I. Silveira:
Smoothing Imprecise 1.5D Terrains. WAOA 2008: 214-226 - [i2]Maarten Löffler, Jeff M. Phillips:
Shape Fitting on Point Sets with Probability Distributions. CoRR abs/0812.2967 (2008) - 2007
- [j1]Thierry de Kok, Marc J. van Kreveld, Maarten Löffler:
Generating realistic terrains with higher-order Delaunay triangulations. Comput. Geom. 36(1): 52-65 (2007) - [c6]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Largest Subsets of Triangles in a Triangulation. CCCG 2007: 213-216 - [c5]Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Optimization for First Order Delaunay Triangulations. WADS 2007: 175-187 - [c4]Maarten Löffler, Marc J. van Kreveld:
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. WADS 2007: 446-457 - [c3]Maarten Löffler, Marc J. van Kreveld:
Approximating Largest Convex Hulls for Imprecise Points. WAOA 2007: 89-102 - 2006
- [c2]Maarten Löffler, Marc J. van Kreveld:
Largest and Smallest Tours and Convex Hulls for Imprecise Points. SWAT 2006: 375-387 - 2005
- [c1]Thierry de Kok, Marc J. van Kreveld, Maarten Löffler:
Generating Realistic Terrains with Higher-Order Delaunay Triangulations. ESA 2005: 343-354 - [i1]Thierry de Kok, Marc J. van Kreveld, Maarten Löffler:
Minimizing local minima in terrains with higher-order Delaunay triangulations. EuroCG 2005: 115-118
Coauthor Index
[c95] [j55] [c93] [j51] [c86] [j49] [j47] [c79] [c75] [i48] [i45] [j45] [j44] [c74] [i42] [j35] [c67] [c65] [c60] [r1] [i36] [i35] [i32] [c57] [c56] [i29] [j31] [c51] [c50] [j30] [j25] [c42] [c39] [j22] [c35] [i17] [j19] [j13] [j11] [j9] [j8] [j5] [c25] [c24] [j3] [c15] [j2] [c11] [c10] [c8] [j1] [c6] [c5] [c4] [c3] [c2] [c1] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
