24 citations · 35 across the 16 of their papers we have counts for
17 papers
An Improved Bound for Plane Covering Paths
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8
A covering path for a finite set of points in the plane is a polygonal path such that every point of lies on a segment of the path. The vertices of the path need not be at…
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
Recognizing Weakly Simple Polygons
Hugo Akitaya, Greg Aloupis, Jeff Erickson +1
We present an -time algorithm that determines whether a given planar -gon is weakly simple. This improves upon an -time algorithm by Chang, Erickson, a…
Compatible Connectivity-Augmentation of Planar Disconnected Graphs
Greg Aloupis, Luis Barba, Paz Carmi +3
Motivated by applications to graph morphing, we consider the following \emph{compatible connectivity-augmentation problem}: We are given a labelled -vertex planar graph, $\mathc…
Covering Folded Shapes
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine +6
Can folding a piece of paper flat make it larger? We explore whether a shape must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary f…
The Complexity of Order Type Isomorphism
Greg Aloupis, John Iacono, Stefan Langerman +1
The order type of a point set in maps each -tuple of points to its orientation (e.g., clockwise or counterclockwise in ). Two point sets and have the sa…