Universal point set

In graph drawing, a universal point set of order n is a set S of points in the Euclidean plane with the property that every n-vertex planar graph has… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2011-2015
01220112015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A point set S ⊆ R is universal for a class G if every graph of G has a planar straight-line embedding on S. It is well-known that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2013
Review
2013
An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Article history: Received 14 October 2011 Accepted 27 March 2012 Available online xxxx Communicated by D. Wagner 
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
A point set P ⊆ R is universal for a class G if every graph of G has a planar straight-line embedding into P . We prove that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?