Distance-preserving approximations of polygonal paths

J. Gudmundsson, G. Narasimhan, M.H.M. Smid

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

Abstract

Given a polygonal path P with vertices p 1, p 2,...,p n and a real number t = 1, a path TeX is a t-distance-preserving approximation of P if 1 = i 1¿
Original languageEnglish
Title of host publicationFoundations of Software Technology and Theoretical Computer Science (Proceedings 23rd Conference, FSTTCS 2003, Mumbai, India, December 15-17, 2003)
EditorsP.K. Pandya, J. Radhakrishnan
Place of PublicationBerlin
PublisherSpringer
Pages217-228
ISBN (Print)3-540-20680-9
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science
Volume2914
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Distance-preserving approximations of polygonal paths'. Together they form a unique fingerprint.

Cite this