120 citations · 121 across the 4 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2026
Almost Linear Universal Point Sets for Planar Graphs
Taylor Gordon
A point set is universal for planar graphs on vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universa…
cs.CG2014★ 1 cited
The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations
Taylor Gordon
We consider embeddings of planar graphs in where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends…
cs.CG2012
Simultaneous Embeddings with Vertices Mapping to Pre-Specified Points
Taylor Gordon
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vert…