A star-shaped polygon is a polygonal region in the plane that is a star domain, that is, a polygon that contains a point from which the entireâ€¦Â (More)

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

2007

2007

In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at randomâ€¦Â (More)

Is this relevant?

2003

2003

- Alejandro LÃ³pez-Ortiz, Sven Schuierer
- Inf. Comput.
- 2003

We study the problem of on-line searching for a target inside a polygon. In particular, we propose a strategy for finding aâ€¦Â (More)

Is this relevant?

1999

1999

- Christian Sohler
- CCCG
- 1999

In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly atâ€¦Â (More)

Is this relevant?

1997

1997

- Jae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa
- Symposium on Computational Geometry
- 1997

We consider searching problems in robotics that a robot has to find a path to a target by traveling in an unknown starshapedâ€¦Â (More)

Is this relevant?

1995

1995

- Christian Icking, Rolf Klein
- Symposium on Computational Geometry
- 1995

We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitraryâ€¦Â (More)

Is this relevant?

1994

1994

- Laxmi Gewali
- CCCG
- 1994

We consider the problem of recognizing star-polygons under staircase visibility (s-visibility). We show that the s-visibilityâ€¦Â (More)

Is this relevant?

1988

1988

- David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
- Algorithmica
- 1988

A key problem in computational geometry is the identification of subsets of a point set having particular properties. We studyâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- J. Mark Keil
- SIAM J. Comput.
- 1985

The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntacticâ€¦Â (More)

Is this relevant?

Review

1981

Review

1981

- David Avis, Godfried T. Toussaint
- Pattern Recognition
- 1981

In this paper we show how a theorem in plane geometry can be converted into an O(n log n) algorithm for decomposing a polygonâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- D. T. Lee, Franco P. Preparata
- J. ACM
- 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â€¦Â (More)

Is this relevant?