On simultaneous inner and outer approximation of shapes

Rudolf Fleischer, Kurt Mehlhorn, Gunter Rote, Emo Welzl, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Most motion planning problems, except for the simplest examples, have at least a quadratic time complexity in the worst case. Our study is motivated by the attempt to reduce the complexity of the polygon containment problem, and also the motion planning problem. In each case, we describe algorithms which will run faster when certain implicit slackness parameters of the input are bounded away from 1. These algorithms illustrate a new algorithmic paradigm in computational geometry for coping with complexity.

Original languageEnglish (US)
Title of host publicationProc Sixth Annu Symp Comput Geom
PublisherPubl by ACM
Pages216-224
Number of pages9
ISBN (Print)0897913620
StatePublished - 1990
EventProceedings of the Sixth Annual Symposium on Computational Geometry - Berkeley, CA, USA
Duration: Jun 6 1990Jun 8 1990

Other

OtherProceedings of the Sixth Annual Symposium on Computational Geometry
CityBerkeley, CA, USA
Period6/6/906/8/90

Fingerprint

Motion planning
Computational geometry

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Fleischer, R., Mehlhorn, K., Rote, G., Welzl, E., & Yap, C. (1990). On simultaneous inner and outer approximation of shapes. In Proc Sixth Annu Symp Comput Geom (pp. 216-224). Publ by ACM.

On simultaneous inner and outer approximation of shapes. / Fleischer, Rudolf; Mehlhorn, Kurt; Rote, Gunter; Welzl, Emo; Yap, Chee.

Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. p. 216-224.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fleischer, R, Mehlhorn, K, Rote, G, Welzl, E & Yap, C 1990, On simultaneous inner and outer approximation of shapes. in Proc Sixth Annu Symp Comput Geom. Publ by ACM, pp. 216-224, Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, 6/6/90.
Fleischer R, Mehlhorn K, Rote G, Welzl E, Yap C. On simultaneous inner and outer approximation of shapes. In Proc Sixth Annu Symp Comput Geom. Publ by ACM. 1990. p. 216-224
Fleischer, Rudolf ; Mehlhorn, Kurt ; Rote, Gunter ; Welzl, Emo ; Yap, Chee. / On simultaneous inner and outer approximation of shapes. Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. pp. 216-224
@inproceedings{c7700d81117e4b8bae901e3c80c026d2,
title = "On simultaneous inner and outer approximation of shapes",
abstract = "Most motion planning problems, except for the simplest examples, have at least a quadratic time complexity in the worst case. Our study is motivated by the attempt to reduce the complexity of the polygon containment problem, and also the motion planning problem. In each case, we describe algorithms which will run faster when certain implicit slackness parameters of the input are bounded away from 1. These algorithms illustrate a new algorithmic paradigm in computational geometry for coping with complexity.",
author = "Rudolf Fleischer and Kurt Mehlhorn and Gunter Rote and Emo Welzl and Chee Yap",
year = "1990",
language = "English (US)",
isbn = "0897913620",
pages = "216--224",
booktitle = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",

}

TY - GEN

T1 - On simultaneous inner and outer approximation of shapes

AU - Fleischer, Rudolf

AU - Mehlhorn, Kurt

AU - Rote, Gunter

AU - Welzl, Emo

AU - Yap, Chee

PY - 1990

Y1 - 1990

N2 - Most motion planning problems, except for the simplest examples, have at least a quadratic time complexity in the worst case. Our study is motivated by the attempt to reduce the complexity of the polygon containment problem, and also the motion planning problem. In each case, we describe algorithms which will run faster when certain implicit slackness parameters of the input are bounded away from 1. These algorithms illustrate a new algorithmic paradigm in computational geometry for coping with complexity.

AB - Most motion planning problems, except for the simplest examples, have at least a quadratic time complexity in the worst case. Our study is motivated by the attempt to reduce the complexity of the polygon containment problem, and also the motion planning problem. In each case, we describe algorithms which will run faster when certain implicit slackness parameters of the input are bounded away from 1. These algorithms illustrate a new algorithmic paradigm in computational geometry for coping with complexity.

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

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

M3 - Conference contribution

AN - SCOPUS:0024984188

SN - 0897913620

SP - 216

EP - 224

BT - Proc Sixth Annu Symp Comput Geom

PB - Publ by ACM

ER -