Constructing approximate shortest path maps in three dimensions

Sariel Har-Peled

doi:10.1137/S0097539797325223

Constructing approximate shortest path maps in three dimensions

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

Abstract

A new technique is presented for constructing a data structure that approximates shortest path maps in R^d. By applying this technique, results on approximate shortest path maps in R³ are obtained.

Original language	English (US)
Pages (from-to)	1182-1197
Number of pages	16
Journal	SIAM Journal on Computing
Volume	28
Issue number	4
DOIs	https://doi.org/10.1137/S0097539797325223
State	Published - 1999
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
General Mathematics

Online availability

10.1137/S0097539797325223

Library availability

Discover UIUC Full Text

Cite this

@article{c6db601de9c6418cb20fdceb315852e8,

title = "Constructing approximate shortest path maps in three dimensions",

abstract = "A new technique is presented for constructing a data structure that approximates shortest path maps in Rd. By applying this technique, results on approximate shortest path maps in R3 are obtained.",

author = "Sariel Har-Peled",

year = "1999",

doi = "10.1137/S0097539797325223",

language = "English (US)",

volume = "28",

pages = "1182--1197",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Constructing approximate shortest path maps in three dimensions

AU - Har-Peled, Sariel

PY - 1999

Y1 - 1999

N2 - A new technique is presented for constructing a data structure that approximates shortest path maps in Rd. By applying this technique, results on approximate shortest path maps in R3 are obtained.

AB - A new technique is presented for constructing a data structure that approximates shortest path maps in Rd. By applying this technique, results on approximate shortest path maps in R3 are obtained.

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

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

U2 - 10.1137/S0097539797325223

DO - 10.1137/S0097539797325223

M3 - Article

AN - SCOPUS:0032631074

SN - 0097-5397

VL - 28

SP - 1182

EP - 1197

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 4

ER -

Constructing approximate shortest path maps in three dimensions

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this