Maarten Löffler

1.0k total citations
46 papers, 291 citations indexed

About

Maarten Löffler is a scholar working on Computer Graphics and Computer-Aided Design, Signal Processing and Computational Mechanics. According to data from OpenAlex, Maarten Löffler has authored 46 papers receiving a total of 291 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computer Graphics and Computer-Aided Design, 15 papers in Signal Processing and 13 papers in Computational Mechanics. Recurrent topics in Maarten Löffler's work include Computational Geometry and Mesh Generation (45 papers), Data Management and Algorithms (15 papers) and Advanced Graph Theory Research (13 papers). Maarten Löffler is often cited by papers focused on Computational Geometry and Mesh Generation (45 papers), Data Management and Algorithms (15 papers) and Advanced Graph Theory Research (13 papers). Maarten Löffler collaborates with scholars based in Netherlands, United States and Germany. Maarten Löffler's co-authors include Marc van Kreveld, Jack Snoeyink, Rodrigo I. Silveira, Wolfgang Mulzer, Vishal Verma, Luc Devroye, Prosenjit Bose, Kevin Buchin, Joseph S. B. Mitchell and Pat Morin and has published in prestigious journals such as SHILAP Revista de lepidopterología, ACM Transactions on Graphics and SIAM Journal on Computing.

In The Last Decade

Maarten Löffler

40 papers receiving 283 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Maarten Löffler Netherlands 9 219 133 85 63 56 46 291
Antoine Vigneron South Korea 10 178 0.8× 87 0.7× 96 1.1× 49 0.8× 50 0.9× 44 309
Wolfgang Mulzer Germany 10 178 0.8× 108 0.8× 69 0.8× 96 1.5× 28 0.5× 56 286
Hazel Everett Canada 11 233 1.1× 61 0.5× 135 1.6× 105 1.7× 41 0.7× 45 334
Manuel Abellanas Spain 8 140 0.6× 60 0.5× 60 0.7× 67 1.1× 20 0.4× 29 220
Chan-Su Shin South Korea 8 124 0.6× 51 0.4× 64 0.8× 31 0.5× 22 0.4× 37 196
Mark Lanthier Canada 8 132 0.6× 81 0.6× 69 0.8× 21 0.3× 65 1.2× 10 214
Suneeta Ramaswami United States 11 140 0.6× 43 0.3× 60 0.7× 52 0.8× 53 0.9× 28 261
Elmar Langetepe Germany 10 114 0.5× 37 0.3× 81 1.0× 25 0.4× 30 0.5× 34 230
Lyudmil Aleksandrov Bulgaria 6 114 0.5× 70 0.5× 75 0.9× 42 0.7× 31 0.6× 12 182
Menelaos I. Karavelas Greece 10 142 0.6× 32 0.2× 87 1.0× 51 0.8× 117 2.1× 26 285

Countries citing papers authored by Maarten Löffler

Since Specialization
Citations

This map shows the geographic impact of Maarten Löffler's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Maarten Löffler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Maarten Löffler more than expected).

Fields of papers citing papers by Maarten Löffler

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Maarten Löffler. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Maarten Löffler. The network helps show where Maarten Löffler may publish in the future.

Co-authorship network of co-authors of Maarten Löffler

This figure shows the co-authorship network connecting the top 25 collaborators of Maarten Löffler. A scholar is included among the top collaborators of Maarten Löffler based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Maarten Löffler. Maarten Löffler is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Löffler, Maarten, et al.. (2021). Adjacency Graphs of Polyhedral Surfaces. arXiv (Cornell University). 1 indexed citations
2.
Löffler, Maarten, et al.. (2021). Labeling nonograms: Boundary labeling for curve arrangements. Computational Geometry. 98. 101791–101791. 1 indexed citations
3.
Löffler, Maarten, et al.. (2020). A fully polynomial time approximation scheme for the smallest diameter of imprecise points. Theoretical Computer Science. 814. 259–270. 1 indexed citations
4.
Hurtado, Ferrán, Matias Korman, Marc van Kreveld, et al.. (2017). Colored spanning graphs for set visualization. Computational Geometry. 68. 262–276. 2 indexed citations
5.
Aichholzer, Oswin, Thomas Hackl, Matias Korman, et al.. (2017). Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. TU/e Research Portal. 233–238. 1 indexed citations
6.
Ackerman, Eyal, et al.. (2016). The Flip Diameter of Rectangulations and Convex Subdivisions. Discrete Mathematics & Theoretical Computer Science. Vol. 18 no. 3(Combinatorics). 1 indexed citations
7.
Kostitsyna, Irina, Maarten Löffler, Valentin Polishchuk, & Frank Staals. (2016). On the Complexity of Minimum-Link Path Problems. TU/e Research Portal. 8(2). 80–108. 2 indexed citations
8.
Gray, Chris, Frank Kammer, Maarten Löffler, & Rodrigo I. Silveira. (2012). Removing local extrema from imprecise terrains. Computational Geometry. 45(7). 334–349. 4 indexed citations
9.
Löffler, Maarten & Wolfgang Mulzer. (2011). Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent. Symposium on Discrete Algorithms. 1759–1777. 3 indexed citations
10.
Knauer, Christian, et al.. (2011). The directed Hausdorff distance between imprecise point sets. Theoretical Computer Science. 412(32). 4173–4186. 11 indexed citations
11.
Löffler, Maarten & Wolfgang Mulzer. (2011). Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. 1759–1777. 2 indexed citations
12.
Bose, Prosenjit, Luc Devroye, Maarten Löffler, Jack Snoeyink, & Vishal Verma. (2010). Almost all Delaunay triangulations have stretch factor greater than π/2. Computational Geometry. 44(2). 121–127. 14 indexed citations
13.
Buchin, Kevin, Sergio Cabello, Joachim Gudmundsson, et al.. (2010). Finding the Most Relevant Fragments in Networks. Journal of Graph Algorithms and Applications. 14(2). 307–336. 1 indexed citations
14.
Kreveld, Marc van, Maarten Löffler, & Rodrigo I. Silveira. (2009). Optimization for first order Delaunay triangulations. Computational Geometry. 43(4). 377–394. 17 indexed citations
15.
Löffler, Maarten & Jack Snoeyink. (2009). Delaunay triangulation of imprecise points in linear time after preprocessing. Computational Geometry. 43(3). 234–242. 27 indexed citations
16.
Bose, Prosenjit, Luc Devroye, Maarten Löffler, Jack Snoeyink, & Vishal Verma. (2009). The spanning ratio of the Delaunay triangulation is greater than pi/2.. Canadian Conference on Computational Geometry. 165–167. 15 indexed citations
17.
Löffler, Maarten & Marc van Kreveld. (2009). Largest bounding box, smallest diameter, and related problems on imprecise points. Computational Geometry. 43(4). 419–433. 35 indexed citations
18.
Kreveld, Marc van & Maarten Löffler. (2008). Approximating largest convex hulls for imprecise points. Journal of Discrete Algorithms. 6(4). 583–594. 8 indexed citations
19.
Kreveld, Marc van, et al.. (2008). Planar bichromatic minimum spanning trees. Journal of Discrete Algorithms. 7(4). 469–478. 7 indexed citations
20.
Löffler, Maarten & Marc van Kreveld. (2008). Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica. 56(2). 235–269. 55 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026