article

The complexity of the free space for a robot moving amidst fat obstacles

Authors:

A. Frank van der Stappen,

Dan Halperin,

Mark H. OvermarsAuthors Info & Claims

Computational Geometry: Theory and Applications, Volume 3, Issue 6

Pages 353 - 373

https://doi.org/10.1016/0925-7721(93)90007-S

Published: 01 December 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Bonnet ÉCabello SMulzer W(2023)Maximum Matchings in Geometric Intersection GraphsDiscrete & Computational Geometry10.1007/s00454-023-00564-370:3(550-579)Online publication date: 9-Sep-2023
https://dl.acm.org/doi/10.1007/s00454-023-00564-3
De Carufel JGheibi AMaheshwari ASack JScheffer C(2014)Similarity of polygonal curves in the presence of outliersComputational Geometry: Theory and Applications10.1016/j.comgeo.2014.01.00247:5(625-641)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1016/j.comgeo.2014.01.002
Aronov BBerg M(2012)Unions of Fat Convex Polytopes Have Short SkeletonsDiscrete & Computational Geometry10.5555/3116652.311692148:1(53-64)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.5555/3116652.3116921
Show More Cited By

Recommendations

Safe Robot Navigation Among Moving and Steady Obstacles
Robotic motion planning in a dynamic environment with moving obstacles
Planning a time-minimal motion among moving obstacles

Motion planning for a point robot is studied in a time-varying environment. Each obstacle is a convex polygon that moves in a fixed direction at a constant speed. The point to be reached (referred to as the destination point) also moves along a known ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computational Geometry: Theory and Applications

Computational Geometry: Theory and Applications Volume 3, Issue 6

Dec. 1993

64 pages

ISSN:0925-7721

Editors:
Jörg-Rüdiger Sack
Carleton Univ., Ottawa, Ont., Canada
,
Jorge Urrutia
Univ. of Ottawa, Ottawa, Ont., Canada

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 December 1993

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bonnet ÉCabello SMulzer W(2023)Maximum Matchings in Geometric Intersection GraphsDiscrete & Computational Geometry10.1007/s00454-023-00564-370:3(550-579)Online publication date: 9-Sep-2023
https://dl.acm.org/doi/10.1007/s00454-023-00564-3
De Carufel JGheibi AMaheshwari ASack JScheffer C(2014)Similarity of polygonal curves in the presence of outliersComputational Geometry: Theory and Applications10.1016/j.comgeo.2014.01.00247:5(625-641)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1016/j.comgeo.2014.01.002
Aronov BBerg M(2012)Unions of Fat Convex Polytopes Have Short SkeletonsDiscrete & Computational Geometry10.5555/3116652.311692148:1(53-64)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.5555/3116652.3116921
Gajentaan AOvermars M(2012)On a class of O(n2) problems in computational geometryComputational Geometry: Theory and Applications10.1016/j.comgeo.2011.11.00645:4(140-152)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1016/j.comgeo.2011.11.006
Buchin KBuchin MVan Kreveld MLöffler MSilveira RWenk CWiratma L(2010)Median trajectoriesProceedings of the 18th annual European conference on Algorithms: Part I10.5555/1888935.1888989(463-474)Online publication date: 6-Sep-2010
https://dl.acm.org/doi/10.5555/1888935.1888989
de Berg MKirkpatrick DMitchell J(2010)Better bounds on the union complexity of locally fat objectsProceedings of the twenty-sixth annual symposium on Computational geometry10.1145/1810959.1810968(39-47)Online publication date: 13-Jun-2010
https://dl.acm.org/doi/10.1145/1810959.1810968
Langberg MSchulman L(2009)Contraction and Expansion of Convex SetsDiscrete & Computational Geometry10.5555/3116261.311639642:4(594-614)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.5555/3116261.3116396
Berg M(2008)Improved Bounds on the Union Complexity of Fat ObjectsDiscrete & Computational Geometry10.5555/3116277.311656140:1(127-140)Online publication date: 1-Jul-2008
https://dl.acm.org/doi/10.5555/3116277.3116561
de Berg MGray C(2006)Vertical ray shooting and computing depth orders for fat objectsProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109612(494-503)Online publication date: 22-Jan-2006
https://dl.acm.org/doi/10.5555/1109557.1109612
de Berg MMitchell JRote G(2005)Vertical ray shooting for fat objectsProceedings of the twenty-first annual symposium on Computational geometry10.1145/1064092.1064137(288-295)Online publication date: 6-Jun-2005
https://dl.acm.org/doi/10.1145/1064092.1064137
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Safe Robot Navigation Among Moving and Steady Obstacles

Robotic motion planning in a dynamic environment with moving obstacles

Planning a time-minimal motion among moving obstacles

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations