Abstract
Intuitively, a set of sites on a surface is in Euclidean position if points are so close to each other that planar algorithms can be easily adapted in order to solve most of the classical problems in Computational Geometry. In this work we formalize a definition of the term “Euclidean position” for a relevant class of metric spaces, the Euclidean 2-orbifolds, and present methods to compute whether a set of sites has this property. We also show the relation between the convex hull of a point set in Euclidean position on a Euclidean 2-orbifold and the planar convex hull of the inverse image (via the quotient map) of the set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
