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.

2010

2010

In this paper, an algorithm to searching for the kernel of a simple polygon is proposed. The concave vertices of the polygon are… Expand

Is this relevant?

2008

2008

A star-shapeddrawing of a graph is a straight-line drawing such that each inner facial cycle is drawn as a star-shaped polygon… Expand

Is this relevant?

1999

1999

In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at… Expand

Is this relevant?

1994

1994

Abstract We consider the problem of recognizing star-polygons under staircase visibility (s-visibility). We show that the s… Expand

Is this relevant?

1991

1991

Let O be some set of orientations, i.e., O 0 ; 360). In this paper we look at the consequences of deening visibility based on… Expand

Is this relevant?

1990

1990

A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study… Expand

Is this relevant?

1986

1986

A new and distinct interspecific rootstock tree having the following unique combination of outstanding features that are… Expand

Is this relevant?

Highly Cited

1985

Highly Cited

1985

The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic… Expand

Is this relevant?

Highly Cited

1981

Highly Cited

1981

Abstract In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

The kernel K(P) of a simple polygon P wah n verUces is the locus of the points internal to P from which all verUces of P are… Expand

Is this relevant?