Planar straight-line graph

Known as: PSLG, Planar straight line graph, Planar subdivision 
Planar straight-line graph (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We show that every planar straight line graph (PSLG) with n vertices can be augmented to a 2-edge-connected PSLG with the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
An obstacle representation of a planar straight-line graph (PSLG) G consists of the choice and placement of a set of opaque… (More)
  • figure 3
  • figure 1
  • figure 2
Is this relevant?
2012
2012
It is shown that every connected planar straight line graph with n ≥ 3 vertices has an embedding preserving augmentation to a 2… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We characterize the planar straight line graphs (Pslgs) that can be augmented to 3-connected and 3-edge-connected Pslgs… (More)
  • figure 1
Is this relevant?
2011
2011
We study straight skeletons and make both theoretical and practical contributions which support new approaches to the computation… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
It is known that for any set V of n ≥ 4 points in the plane, not in convex position, there is a 3-connected planar straight line… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
We show that any PSLG with v vertices can be tri angulated with no angle larger than by adding O v log v Steiner points in O v… (More)
  • figure I
Is this relevant?