Article

Free access

Position-independent near optimal searching and on-line recognition in star polygons

Authors:

Alejandro López-Ortiz,

Sven SchuiererAuthors Info & Claims

SCG '97: Proceedings of the thirteenth annual symposium on Computational geometry

Pages 445 - 447

https://doi.org/10.1145/262839.263077

Published: 01 August 1997 Publication History

PDF eReader

References

[1]

R. Baeza-Yates, J. Culberson and G. Rawlins. "Searching in the plane", In}ormation and Computation, Vol. 106, (1993), pp. 234-252.

Digital Library

Google Scholar

[2]

A. Datta, Ch. Hipke, and S. Schuierer. "Competitive searching in polygons--beyond generalized streets", in Proc. Sixth Annual International Syrup. on Algorithms and Computation, pages 32-41. LNCS 1004, 1995.

Digital Library

Google Scholar

[3]

A. Datta and Ch. Icking. "Competitive searching in a generalized street", Proc. i Oth A CM Syrup. on Computational Geometry, (1994), pp. 175-182.

Digital Library

Google Scholar

[4]

S. Gal. Search Games, Academic Press, 1980.

Google Scholar

[5]

Ch. Icking and R. Klein. "Searching for the kernel of a polygon. A competitive strategy", Proc. 11th ACM Syrup. on Computational Geometry, (1995).

Digital Library

Google Scholar

[6]

R. Klein. "Walking an unknown street with bounded detour", Computational Geometry: Theory and Applications, Vol. 1, (1992), pp. 325-351.

Digital Library

Google Scholar

[7]

J. Kleinberg. "On-line search in a simple polygon", Proc. of 5th A CM-SIAM Syrup. on Discrete Algorithms, (1994), pp. s-15.

Digital Library

Google Scholar

[8]

A. Lopez-Ortiz. "On-line target searching in bounded and unbounded domains", Ph.D. Thesis, University of Waterloo, 1996.

Digital Library

Google Scholar

[9]

A. Lopez-Ortiz and S. Schuierer. "Going home through an,mknown street", Proc. of $th Workshop on Data Structures and Algorithms, 1995, LNCS 955, Springer- Verlag, pp. 135-146.

Digital Library

Google Scholar

[10]

A. L6pez-Ortiz and S. Schuierer. "Generalized streets revisited", In J. Diaz and M. Serna, editors, Proc. 4th European Syrup. on Algorithms, LNCS 1136, pages 546- 558. Springer Verlag, 1996.

Digital Library

Google Scholar

[11]

A. Lopez-Ortiz and S. Schuierer. "Walking streets faster", Proc. of 5th Scandinavian Workshop in AI. 9orithmic Theory, 1996, LNCS 1097, Springer-Verlag, pp. 345-356.

Digital Library

Google Scholar

Cited By

View all

López-Ortiz ASchuierer S(2003)Searching and on-line recognition of star-shaped polygonsInformation and Computation10.1016/S0890-5401(03)00081-6185:1(66-88)Online publication date: 25-Aug-2003
https://dl.acm.org/doi/10.1016/S0890-5401%2803%2900081-6
Aichholzer OAurenhammer FIcking CKlein RLangetepe ERote G(2001)Generalized self-approaching curvesDiscrete Applied Mathematics10.1016/S0166-218X(00)00233-X109:1-2(3-24)Online publication date: 15-Apr-2001
https://dl.acm.org/doi/10.1016/S0166-218X%2800%2900233-X
Aichholzer OAurenhammer FIcking CKlein RLangetepe ERote G(2001)Generalized Self-Approaching CurvesAlgorithms and Computation10.1007/3-540-49381-6_34(317-327)Online publication date: 29-Mar-2001
https://doi.org/10.1007/3-540-49381-6_34
Show More Cited By

Index Terms

Position-independent near optimal searching and on-line recognition in star polygons

Recommendations

Searching and on-line recognition of star-shaped polygons

We study the problem of on-line searching for a target inside a polygon. In particular, we propose a strategy for finding a target of unknown location in a star-shaped polygon with a competitive ratio of 11.52. We also provide a lower bound of 9 for the ...
A simple linear hidden-line algorithm for star-shaped polygons

A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these ...
On partitioning rectilinear polygons into star-shaped polygons
Abstract
We present an algorithm for finding optimum partitions of simple monotone rectilinear polygons into star-shaped polygons. The algorithm may introduce Steiner points and its time complexity isO(n), wheren is the number of vertices in the polygon. ...

Comments

Information & Contributors

Information

Published In

SCG '97: Proceedings of the thirteenth annual symposium on Computational geometry

August 1997

490 pages

ISBN:0897918789

DOI:10.1145/262839

Chairman:
Jean-Daniel Boissonnat
INRIA Sophia-Antipolis

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG97

Sponsor:

SoCG97: 13th ACM Symposium on Computational Geometry

June 4 - 6, 1997

Nice, France

Acceptance Rates

SCG '97 Paper Acceptance Rate 75 of 199 submissions, 38%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
218
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)11

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

López-Ortiz ASchuierer S(2003)Searching and on-line recognition of star-shaped polygonsInformation and Computation10.1016/S0890-5401(03)00081-6185:1(66-88)Online publication date: 25-Aug-2003
https://dl.acm.org/doi/10.1016/S0890-5401%2803%2900081-6
Aichholzer OAurenhammer FIcking CKlein RLangetepe ERote G(2001)Generalized self-approaching curvesDiscrete Applied Mathematics10.1016/S0166-218X(00)00233-X109:1-2(3-24)Online publication date: 15-Apr-2001
https://dl.acm.org/doi/10.1016/S0166-218X%2800%2900233-X
Aichholzer OAurenhammer FIcking CKlein RLangetepe ERote G(2001)Generalized Self-Approaching CurvesAlgorithms and Computation10.1007/3-540-49381-6_34(317-327)Online publication date: 29-Mar-2001
https://doi.org/10.1007/3-540-49381-6_34
Lee JShin CKim JShin SChwa KBoissonnat J(1997)New competitive strategies for searching in unknown star-shaped polygonsProceedings of the thirteenth annual symposium on Computational geometry10.1145/262839.263062(427-429)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/262839.263062

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Searching and on-line recognition of star-shaped polygons

A simple linear hidden-line algorithm for star-shaped polygons

On partitioning rectilinear polygons into star-shaped polygons

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Searching and on-line recognition of star-shaped polygons

A simple linear hidden-line algorithm for star-shaped polygons

On partitioning rectilinear polygons into star-shaped polygons

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations