10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
4 papers · 2 filters
Expected Complexity of Routing in 6 and Half- 6 Graphs
Prosenjit Bose, Jean-Lou de Carufel, Olivier Devillers
We study online routing algorithms on the 6-graph and the half-6-graph (which is equivalent to a variant of the Delaunay triangulation). Given a source vertex s and a target…
Flip Distance to some Plane Configurations
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
We study an old geometric optimization problem in the plane. Given a perfect matching on a set of points in the plane, we can transform it to a non-crossing perfect matchin…
Drawing HV-Restricted Planar Graphs
Stephane Durocher, Stefan Felsner, Saeed Mehrabi +1
A strict orthogonal drawing of a graph in is a drawing of such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal…
Constrained Orthogonal Segment Stabbing
Sayan Bandyapadhyay, Saeed Mehrabi
Let and each be a set of orthogonal line segments in the plane. A line segment \emph{stabs} a line segment if . It is known that t…