<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Hormann, Kai</dc:contributor>
  <dc:creator>Anisimov, Dmitry</dc:creator>
  <dc:date>2017-05-23</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">Different coordinate systems allow to uniquely determine the position of a geometric  element in space. In this dissertation, we consider a coordinate system that lets us  determine the position of a two-dimensional point in the plane with respect to an  arbitrary simple polygon. Coordinates of this system are called generalized barycentric  coordinates in 2D and are widely used in computer graphics and computational  mechanics. There exist many coordinate functions that satisfy all the basic properties  of barycentric coordinates, but they differ by a number of other properties. We start by  providing an extensive comparison of all existing coordinate functions and pointing out  which important properties of generalized barycentric coordinates are not satisfied by  these functions. This comparison shows that not all of existing coordinates have fully  investigated properties, and we complete such a theoretical analysis for a particular  one-parameter family of generalized barycentric coordinates for strictly convex  polygons. We also perform numerical analysis of this family and show how to avoid  computational instabilities near the polygon’s boundary when computing these  coordinates in practice. We conclude this analysis by implementing some members of  this family in the Computational Geometry Algorithm Library. In the second half of this  dissertation, we present a few novel constructions of non-negative and smooth  generalized barycentric coordinates defined over any simple polygon. In this context,  we show that new coordinates with improved properties can be obtained by taking  convex combinations of already existing coordinate functions and we give two  examples of how to use such convex combinations for polygons without and with  interior points. These new constructions have many attractive properties and perform  better than other coordinates in interpolation and image deformation applications.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://localhost:5000/ark:/12658/srd1318813</dc:identifier>
  <dc:identifier>https://susi.usi.ch/global/documents/318813</dc:identifier>
  <dc:identifier>https://susi.usi.ch/documents/318813/files/2017INFO004.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:rero-006-116411</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/12658/srd1318813</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Barycentric coordinates</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Barycentric interpolation</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Subdivision</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns4="xml" ns4:lang="en">Analysis and new constructions of generalized barycentric coordinates in 2D</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_db06</dc:type>
</oai_dc:dc>
