View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Portalgons gone curvy

        Thumbnail
        View/Open
        Bernadet_klein_wassink_bachelorscriptie.pdf (1.329Mb)
        Publication date
        2025
        Author
        Klein Wassink, Bernadet
        Metadata
        Show full item record
        Summary
        In Löffler et al.’s paper, they define portalgon as a set of fragments together with a set of portals that “glue” fragment together along the portals. A portal e = (e^+, e^−) is a pair of directed, equal length edges of two, possibly the same, fragments of F. Let e^+ = uv and e^- = wz, where u, v vertices of the fragment containing e+ and w, z vertices of the fragment containing e^−. Let p^− be a point on e^− and p^+ on e^+. If there is a λ ∈ [0, 1] for which p^− = λu + (1 − λ)v, then p^+ = λw + (1 − λ)z. Furthermore, no edge can be part of multiple portals. In their paper, they explore shortest paths in these portalgons and find out that there is a way to represent the portalgon in such a way that the complexity of shortest paths is bounded. For this, they introduce happiness h; a portalgon is h-happy if any shortest path crosses every portal at most h times. The complexity of shortest paths in an h-happy portalgon is O(n + hm) where n is the number of vertices in the portalgon and m is the number of portals. Furthermore, they also discovered that every polyhedral surface has a representation as a portalgon where the happiness is constant. This means the complexity of shortest paths in the representation is O(n).[9] Note that an object with input size n has asymptotic upper bound O(f(n)) if and only if ∃N, c > 0, ∀n > N, g(n) ≤ c ・ f(n), where g(n) is the amount of components of the object that need constant space [7]. In this thesis, we expand their research into the realm of portalgons where the portals do not have to be linear anymore. Instead we are going to research fitting portals specifically, which are those portals where two corresponding edges are described by the same function and orientation. In other words, exactly those non-linear portals that fit together. We introduce the concepts of portal line segment (line segment between the start and end vertex of the portal) and obstacles (the boundary of the fragment, not the portal itself, intersecting with the portal line segment). In this thesis, we show that any portalgon P with n vertices, m straight portals (portals where its form is described by the portal line segment) and one fitting portal without any intersections between the portal and its portal line in an obstacle has an equivalent portalgon with O(n) vertices and straight portals. Then, it also follows that P has a representation as a portalgon where the happiness is constant. This means the complexity of shortest paths in the representation is O(n).
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/48733
        Collections
        • Theses

        Related items

        Showing items related by title, author, creator and subject.

        • Postpartum as Portal: Reimagining Western Conceptions of the Human Through Linocut Printmaking Workshops on Postpartum and Motherhood by Sophia Pekowsky, 1961950 

          Pekowsky, Sophia (2022)
          While the postpartum time and its associated complications are well researched from a medical and psychological standpoint, there are few philosophical or feminist theories that take the postpartum as a point of study. In ...
        • Making open geo-data attainable for everyone - Requirements for a Layman’s GeoPortal 

          Passier, K.P. (2017)
          Open data are data that are made publicly available by organisations for reuse by third parties. A part of these data has a geographic component; these can be defined as open geo-data. In the Netherlands open geo-data are ...
        • Towards open geo-information science; Assessing academic user involvement in portal development and its effect on their usage and perceived satisfaction 

          Martín Jiménez, G. (2019)
          Since the beginning of the geographic information (GI) sharing efforts and the creation of the firsts spatial data infrastructures (SDIs), organizational and technological constraints have been identified as the cause of ...
        Utrecht university logo