Discrete Critical Values: a General Framework for Silhouettes Computation

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.

[1]  Ralph R. Martin,et al.  Sweeping of three-dimensional objects , 1990, Comput. Aided Des..

[2]  Dinesh Manocha,et al.  Accurate Minkowski sum approximation of polyhedral models , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[3]  T. Banchoff CRITICAL POINTS AND CURVATURE FOR EMBEDDED POLYHEDRA , 1967 .

[4]  H. Whitney Geometric Integration Theory , 1957 .

[5]  Horea T. Ilies,et al.  Detecting and quantifying envelope singularities in the plane , 2007, Comput. Aided Des..

[6]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  L. Guibas,et al.  Polyhedral Tracings and their Convolution , 1996 .

[8]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..

[9]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[10]  J. M. Boardman,et al.  Singularties of differentiable maps , 1967 .

[11]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[12]  Dan Halperin,et al.  Exact and efficient construction of Minkowski sums of convex polyhedra with applications , 2006, Comput. Aided Des..

[13]  Louis J. Billera,et al.  Face Numbers of Polytopes and Complexes , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[14]  Victor J. Milenkovic,et al.  A Monotonic Convolution for Minkowski Sums , 2007, Int. J. Comput. Geom. Appl..

[15]  Sanjeev Bedi,et al.  Surface swept by a toroidal cutter during 5-axis machining , 2001, Comput. Aided Des..

[16]  Valerio Pascucci,et al.  Morse-smale complexes for piecewise linear 3-manifolds , 2003, SCG '03.

[17]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[18]  H. Edelsbrunner,et al.  Foundations of Computational Mathematics: Minneapolis, 2002: Jacobi Sets , 2004 .