◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Löffler

75 papers hereh-index 262.8k citations176 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author6
  • middle author59
  • last author5

Across the 70 of 75 papers where every author was matched, so the position is known.

fields
  • cs.CG61
  • cs.CC4
  • cs.DM3
  • cs.DS2
  • cs.SI2
  • math.CO2
same name
  • M. Löffler — 6 papers, h 10
  • M. Löffler — 4 papers, h 16
  • M. Löffler — 4 papers, h 0
  • M. Löffler — 2 papers, h 12
  • M. Löffler — 1 paper, h 3
  • M. Löffler — 1 paper, h 94

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082026
most citedMaximum-Area Triangle in a Convex Polygon, Revisited

20 citations · 134 across the 54 of their papers we have counts for

collaborators
Showing 2018Show all

4 papers · 1 filter

cs.CG2018

Convex partial transversals of planar regions

Vahideh Keikha, Mees van de Kerkhof, Marc van Kreveld +6

We consider the problem of testing, for a given set of planar regions R and an integer k, whether there exists a convex shape whose boundary intersects at least k region…

cs.CG2018★ 2 cited

Global Curve Simplification

Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler +2

Due to its many applications, \emph{curve simplification} is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information s…

cs.CG2018

How to Fit a Tree in a Box

Hugo A. Akitaya, Maarten Löffler, Irene Parada

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a n​ by n​ grid…

cs.CG2018

On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance

Marc van Kreveld, Maarten Löffler, Lionov Wiratma

We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simpl…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.