Referenced Items are not available for this document.
Visibility graph method is a main method for finding a geodesic path within a polygonal domain. Rotation tree method is a simple and efficient approach to construct visible edges. However, this approach is unable to distinguish whether a visible edge is inside a polygonal domain or not. This paper presents an inside / outside determination algorithm within O(1) time. Based on this algorithm and rotation tree method, we introduce a new approach to find a geodesic path. Our approach isn't optimal in time, but it is easy to implement and do run efficiently.
Published in:
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
(Volume:3
)
Date of Conference: 20-22 Aug. 2010
- Page(s):
- V3-11 - V3-14
- ISSN :
- 2154-7491
- Print ISBN:
- 978-1-4244-6539-2
- INSPEC Accession Number:
- 11537288
- Conference Location :
- Chengdu
- Digital Object Identifier :
- 10.1109/ICACTE.2010.5579834
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
