Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG… Expand

Is this relevant?

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 addition… Expand

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… Expand

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… Expand

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… Expand

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… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Abstract We study the problem of converting triangulated domains to quadrangulations, under a variety of constraints. We obtain a… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

A novel type of skeleton for general polygonal gures, the straight skeleton S(G) of a planar straight line graph G, is introduced… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

We introduce the notion of generalized Delaunay triangulation of a planar straight-line graphG=(V, E) in the Euclidean plane and… Expand

Is this relevant?

Highly Cited

1983

Highly Cited

1983

A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is… Expand

Is this relevant?