Work

Shortest path queries among weighted obstacles in the rectilinear plane

Year: 1995

Type: conference-paper

Abstract: We study the problems of processing single-source and all-pairs shortest path queries among weighted polygonal obstacles in the rectilinear plane.For the single-source case, we construct a data structure in O(n log3/2 n) time and O(n log n) space, where n is the number of obstacle vertices; this data structure enables

Source: Annual Symposium on Computational Geometry (SoCG)

DOI: 10.1145/220279.220319

Authors: Danny Z. Chen, Kevin S. Klenk, Hung-Yi T. Tu

Institutions: University of Notre Dame, Providence University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1992815517

FWCI: 1.54

Cites: 38

Cited by: 15

Related to: 10