Tangential Distance Fields for Mesh Silhouette Problems

A 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, w...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 28; no. 1; pp. 84 - 100
Main Authors: Olson, M., Zhang, H.
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.03.2009
Subjects:
Algorithms
and systems
Computer graphics
Hierarchy and geometric transformations
I.3.5 Computational Geometry and Object Modelling - Geometric algorithms
I.3.5 Computational Geometry and Object Modelling – Geometric algorithms, languages, and systems; Hierarchy and geometric transformations
languages
mesh triangles
Optimization techniques
Studies
tangent space surface representations
tangential distance field
Canada
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A 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.
Bibliography:istex:934D486C8CE1B223F6909B8497DAA2FF29311F8C
ark:/67375/WNG-7M8Q8TX4-Z
ArticleID:CGF1306
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2008.01306.x