20 citations · 134 across the 54 of their papers we have counts for
6 papers · 1 filter
Largest and Smallest Area Triangles on Imprecise Points
Vahideh Keikha, Maarten Löffler, Ali Mohades
Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the are…
Dynamic smooth compressed quadtrees (Fullversion)
Ivor Hoog v. d., Elena Khramtcova, Maarten Löffler
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First,…
Lombardi Drawings of Knots and Links
Philipp Kindermann, Stephen Kobourov, Maarten Löffler +3
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into , such that no more than two points project to the same point in . These dia…
Maximum-Area Quadrilateral in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the…
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Oswin Aichholzer, Thomas Hackl, Matias Korman +5
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph on any set of points in general position…
Maximum-Area Triangle in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
We revisit the following problem: Given a convex polygon , find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobki…