✦ LIBER ✦

A new data structure for shortest path queries in a simple polygon

✍ Scribed by John Hershberger

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 620 KB
Volume: 38
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90064-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Data Structures for Extension Violations

Data Structures for Extension Violations in a Query Range

✍ Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 497 KB

GPSPA: a new adaptive algorithm for main

GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks

✍ Sudip Misra; B. John Oommen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 2 views

A New Approach for the Geodesic Voronoi

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains

✍ E. Papadopoulou; D. T. Lee 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 561 KB

A new algorithm for finding the shortest

A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs

✍ S. Jeyaratnam 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 276 KB

A phenomenological master curve for visc

A phenomenological master curve for viscosity—structure data for two phase polymer systems in simple shear flow

✍ J. Lyngaae-Jorgensen 📂 Article 📅 1983 🏛 Society for Plastic Engineers 🌐 English ⚖ 386 KB

A new criterion for simple-structure tra

A new criterion for simple-structure transformations of core arrays in N-way principal components analysis

✍ René Henrion; Claus A. Andersson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 240 KB

## Ž . Ž . Among the possible orthogonal transformations of core arrays in N-way principal components analysis PCA , the con-Ž ventional approach of body diagonalization turns out not to provide the simplest structure in the sense of minimizing the . number of significant entries . As an alternati