<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>

COPY SCRIPT

For further information contact us at helpdesk@openaire.eu

Computing homotopic shortest paths efficiently

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book , Preprint 01 Jan 2002Embargo end date: 01 Jan 2002 English Publisher:Elsevier BVJournal:Computational Geometry, volume 35, pages 162-172 (issn: 0925-7721,

Authors: Anna Lubiw; Stephen G. Kobourov; Alon Efrat;

doi: 10.1016/j.comgeo.2006.03.003 , 10.1007/3-540-45749-6_38 , 10.48550/arxiv.cs/0204050

arXiv: http://arxiv.org/abs/cs/0204050

Computing homotopic shortest paths efficiently

- Summary
- Subjects
- Metrics

Abstract

This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm than previously known.

12 pages, 11 figures

Related Organizations

View all View all

Keywords

Computational Geometry (cs.CG), FOS: Computer and information sciences, Control and Optimization, I.3.5, Homotopic shortest paths, Computer Science Applications, Shortest path in a polygon, Computational Mathematics, Computational Theory and Mathematics, Computer Science - Computational Geometry, Geometry and Topology, F.2.2, I.3.5;F.2.2

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	45
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%