Published July 2010
| Version public
Journal Article
Trivial Connections on Discrete Surfaces
-
1.
California Institute of Technology
-
2.
Institute for Advanced Study
Abstract
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities with given index. We compute these connections by solving a single linear system built from standard operators. The solution can be used to design rotationally symmetric direction fields with user-specified singularities and directional constraints.
Additional Information
© 2010 The Author(s). Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd. Article first published online: 21 Sep. 2010. Meshes are courtesy of the AIM@Shape Project, the Stanford 3D Scanning Repository, Jotero GbR, and Hugues Hoppe. Thanks to Felix Kälberer, Matthias Nieser, and Konrad Polthier for parameterizing the Aphrodite model using Quad- Cover [KNP07]. This research was partially funded by NSF grants (CCF-0635112, CCF-0811373, CMMI-0757106, and CCF-1011944), the Center for the Mathematics of Information at Caltech, and the IAS at TU München.Additional details
Identifiers
- Eprint ID
- 20387
- Resolver ID
- CaltechAUTHORS:20101011-145011916
Funding
- NSF
- CCF-0635112
- NSF
- CCF-0811373
- NSF
- CMMI-0757106
- NSF
- CCF-1011944
- Caltech Center for the Mathematics of Information
- IAS at TU München
Dates
- Created
-
2010-11-29Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field