Discrete Critical Values: a General Framework for Silhouettes Computation
Frédéric Chazal, André Lieutier, Nicolas Montana
Eurographics Symposium on Geometry Processing, 2009, pp. 1509--1518.
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.
Article URL: http://diglib.eg.org/EG/CGF/volume28/issue5/v28i5pp1509-1518.pdf
BibTeX format:
@inproceedings{Chazal:2009:DCV,
  author = {Frédéric Chazal and André Lieutier and Nicolas Montana},
  title = {Discrete Critical Values: a General Framework for Silhouettes Computation},
  booktitle = {Eurographics Symposium on Geometry Processing},
  pages = {1509--1518},
  year = {2009},
}
Search for more articles by Frédéric Chazal.
Search for more articles by André Lieutier.
Search for more articles by Nicolas Montana.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."