Abstract
If we try to compute the convex hüll or a triangulation of a set of sites in a surface and all those sites are very close to each other, we can intuitively think that planar methods will be valid in this Situation. This intuition has been used on several occasions by many authors, but sometimes it is not clear what ‘very close to each other’ means. In this chapter we will try to clarify this concept, introducing what we call Euclidean position, in such a way that if a set is in Euclidean position then we can work in that set as if it were in the plane.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Grima, C.I., Márquez, A. (2001). Euclidean Position. In: Computational Geometry on Surfaces. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9809-5_2
Download citation
DOI: https://doi.org/10.1007/978-94-015-9809-5_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5908-6
Online ISBN: 978-94-015-9809-5
eBook Packages: Springer Book Archive