Tangential Distance Fields for Mesh Silhouette Problems.
Saved in:
| Title: | Tangential Distance Fields for Mesh Silhouette Problems. |
|---|---|
| Authors: | Olson, M.1 matt.j.olson@gmail.com, Zhang, H.1 |
| Source: | Computer Graphics Forum. Mar2009, Vol. 28 Issue 1, p84-100. 17p. 6 Color Photographs, 15 Diagrams, 2 Charts, 2 Graphs. |
| Subjects: | Tangential coordinates, Mathematical optimization, Maps, Geometric surfaces, Contact transformations, Algorithms |
| Abstract: | Aabstract We consider a tangent-space representation of surfaces that maps each point on a surface to the tangent plane of the surface at that point. Such representations are known to facilitate the solution of several visibility problems, in particular, those involving silhouette analysis. In this paper, we introduce a novel class of distance fields for a given surface defined by its tangent planes. At each point in space, we assign a scalar value which is a weighted sum of distances to these tangent planes. We call the resulting scalar field a ‘tangential distance field’ (TDF). When applied to triangle mesh models, the tangent planes become supporting planes of the mesh triangles. The weighting scheme used to construct a TDF for a given mesh and the way the TDF is utilized can be closely tailored to a specific application. At the same time, the TDFs are continuous, lending themselves to standard optimization techniques such as greedy local search, thus leading to efficient algorithms. In this paper, we use four applications to illustrate the benefit of using TDFs: multi-origin silhouette extraction in Hough space, silhouette-based view point selection, camera path planning and light source placement. [ABSTRACT FROM AUTHOR] |
| Copyright of Computer Graphics Forum is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 36606766 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Tangential Distance Fields for Mesh Silhouette Problems. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Olson%2C+M%2E%22">Olson, M.</searchLink><relatesTo>1</relatesTo><i> matt.j.olson@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Zhang%2C+H%2E%22">Zhang, H.</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Computer+Graphics+Forum%22">Computer Graphics Forum</searchLink>. Mar2009, Vol. 28 Issue 1, p84-100. 17p. 6 Color Photographs, 15 Diagrams, 2 Charts, 2 Graphs. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Tangential+coordinates%22">Tangential coordinates</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Maps%22">Maps</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+surfaces%22">Geometric surfaces</searchLink><br /><searchLink fieldCode="DE" term="%22Contact+transformations%22">Contact transformations</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Aabstract We consider a tangent-space representation of surfaces that maps each point on a surface to the tangent plane of the surface at that point. Such representations are known to facilitate the solution of several visibility problems, in particular, those involving silhouette analysis. In this paper, we introduce a novel class of distance fields for a given surface defined by its tangent planes. At each point in space, we assign a scalar value which is a weighted sum of distances to these tangent planes. We call the resulting scalar field a ‘tangential distance field’ (TDF). When applied to triangle mesh models, the tangent planes become supporting planes of the mesh triangles. The weighting scheme used to construct a TDF for a given mesh and the way the TDF is utilized can be closely tailored to a specific application. At the same time, the TDFs are continuous, lending themselves to standard optimization techniques such as greedy local search, thus leading to efficient algorithms. In this paper, we use four applications to illustrate the benefit of using TDFs: multi-origin silhouette extraction in Hough space, silhouette-based view point selection, camera path planning and light source placement. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Computer Graphics Forum is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=36606766 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1111/j.1467-8659.2008.01306.x Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 17 StartPage: 84 Subjects: – SubjectFull: Tangential coordinates Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Maps Type: general – SubjectFull: Geometric surfaces Type: general – SubjectFull: Contact transformations Type: general – SubjectFull: Algorithms Type: general Titles: – TitleFull: Tangential Distance Fields for Mesh Silhouette Problems. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Olson, M. – PersonEntity: Name: NameFull: Zhang, H. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2009 Type: published Y: 2009 Identifiers: – Type: issn-print Value: 01677055 Numbering: – Type: volume Value: 28 – Type: issue Value: 1 Titles: – TitleFull: Computer Graphics Forum Type: main |
| ResultId | 1 |
