Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas Guibas; John Hershberger; Daniel Leven; Micha Sharir; Robert E. Tarjan

doi:10.1007/BF01840360

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert E. Tarjan

School of Computer Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

Given a triangulation of a simple polygon P, we present linear-time algorithms for solving a collection of problems concerning shortest paths and visibility within P. These problems include calculation of the collection of all shortest paths inside P from a given source vertex S to all the other vertices of P, calculation of the subpolygon of P consisting of points that are visible from a given segment within P, preprocessing P for fast "ray shooting" queries, and several related problems.

Original language	English
Pages (from-to)	209-233
Number of pages	25
Journal	Algorithmica
Volume	2
Issue number	1-4
DOIs	https://doi.org/10.1007/BF01840360
State	Published - Nov 1987

Keywords

Computational geometry
Ray shooting
Shortest paths
Simple polygon
Triangulation
Visibility

Access to Document

10.1007/BF01840360

Cite this

@article{b291c48341d9496284f268b103d121f7,

title = "Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons",

abstract = "Given a triangulation of a simple polygon P, we present linear-time algorithms for solving a collection of problems concerning shortest paths and visibility within P. These problems include calculation of the collection of all shortest paths inside P from a given source vertex S to all the other vertices of P, calculation of the subpolygon of P consisting of points that are visible from a given segment within P, preprocessing P for fast {"}ray shooting{"} queries, and several related problems.",

keywords = "Computational geometry, Ray shooting, Shortest paths, Simple polygon, Triangulation, Visibility",

author = "Leonidas Guibas and John Hershberger and Daniel Leven and Micha Sharir and Tarjan, {Robert E.}",

year = "1987",

month = nov,

doi = "10.1007/BF01840360",

language = "אנגלית",

volume = "2",

pages = "209--233",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "1-4",

}

TY - JOUR

T1 - Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

AU - Guibas, Leonidas

AU - Hershberger, John

AU - Leven, Daniel

AU - Sharir, Micha

AU - Tarjan, Robert E.

PY - 1987/11

Y1 - 1987/11

N2 - Given a triangulation of a simple polygon P, we present linear-time algorithms for solving a collection of problems concerning shortest paths and visibility within P. These problems include calculation of the collection of all shortest paths inside P from a given source vertex S to all the other vertices of P, calculation of the subpolygon of P consisting of points that are visible from a given segment within P, preprocessing P for fast "ray shooting" queries, and several related problems.

AB - Given a triangulation of a simple polygon P, we present linear-time algorithms for solving a collection of problems concerning shortest paths and visibility within P. These problems include calculation of the collection of all shortest paths inside P from a given source vertex S to all the other vertices of P, calculation of the subpolygon of P consisting of points that are visible from a given segment within P, preprocessing P for fast "ray shooting" queries, and several related problems.

KW - Computational geometry

KW - Ray shooting

KW - Shortest paths

KW - Simple polygon

KW - Triangulation

KW - Visibility

UR - http://www.scopus.com/inward/record.url?scp=52449146609&partnerID=8YFLogxK

U2 - 10.1007/BF01840360

DO - 10.1007/BF01840360

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:52449146609

VL - 2

SP - 209

EP - 233

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1-4

ER -

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this