Discrete Critical Values: a General Framework for Silhouettes Computation - Archive ouverte HAL Access content directly
Journal Articles Computer Graphics Forum Year : 2009

Discrete Critical Values: a General Framework for Silhouettes Computation

(1) , ,
1
Frédéric Chazal
Connectez-vous pour contacter l'auteur
André Lieutier
  • Function : Author
Nicolas Montana
  • Function : Author

Abstract

Many shapes resulting from important geometric operations in industrial applications such as Minkowski sums or volume swept by a moving object can be seen as the projection of higher dimensional objects. When such a higher dimensional object is a smooth manifold, the boundary of the projected shape can be computed from the critical points of the projection. In this paper, using the notion of polyhedral chains introduced by Whitney, we introduce a new general framework to define an analogous of the set of critical points of piecewise linear maps defined over discrete objects that can be easily computed. We illustrate our results by showing how they can be used to compute Minkowski sums of polyhedra and volumes swept by moving polyhedra.

Dates and versions

hal-00772400 , version 1 (10-01-2013)

Identifiers

Cite

Frédéric Chazal, André Lieutier, Nicolas Montana. Discrete Critical Values: a General Framework for Silhouettes Computation. Computer Graphics Forum, 2009, 28 (5), pp.1509-1518. ⟨10.1111/j.1467-8659.2009.01527.x⟩. ⟨hal-00772400⟩

Collections

INRIA INRIA2
82 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More