dc.contributor.author | Ju, Tao | en_US |
dc.contributor.author | Schaefer, Scott | en_US |
dc.contributor.author | Warren, Joe | en_US |
dc.contributor.author | Desbrun, Mathieu | en_US |
dc.contributor.editor | Mathieu Desbrun and Helmut Pottmann | en_US |
dc.date.accessioned | 2014-01-29T09:31:12Z | |
dc.date.available | 2014-01-29T09:31:12Z | |
dc.date.issued | 2005 | en_US |
dc.identifier.isbn | 3-905673-24-X | en_US |
dc.identifier.issn | 1727-8384 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/SGP/SGP05/181-186 | en_US |
dc.description.abstract | A fundamental problem in geometry processing is that of expressing a point inside a convex polyhedron as a combination of the vertices of the polyhedron. Instances of this problem arise often in mesh parameterization and 3D deformation. A related problem is to express a vector lying in a convex cone as a non-negative combination of edge rays of this cone. This problem also arises in many applications such as planar graph embedding and spherical parameterization. In this paper, we present a unified geometric construction for building these weighted combinations using the notion of polar duals. We show that our method yields a simple geometric construction for Wachspress's barycentric coordinates, as well as for constructing Colin de Verdière matrices from convex polyhedra - a critical step in Lovasz's method with applications to parameterizations. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Geometric algorithms, languages and systems | en_US |
dc.title | A Geometric Construction of Coordinates for Convex Polyhedra using Polar Duals | en_US |
dc.description.seriesinformation | Eurographics Symposium on Geometry Processing 2005 | en_US |