
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Nancy K. Hays, "Abstracts for Solid Modeling Articles in March 1996 TVCG," IEEE Computer Graphics and Applications, vol. 16, no. 2, pp. 1617, March, 1996.  
BibTex  x  
@article{ 10.1109/MCG.1996.10008, author = {Nancy K. Hays}, title = {Abstracts for Solid Modeling Articles in March 1996 TVCG}, journal ={IEEE Computer Graphics and Applications}, volume = {16}, number = {2}, issn = {02721716}, year = {1996}, pages = {1617}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCG.1996.10008}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  MGZN JO  IEEE Computer Graphics and Applications TI  Abstracts for Solid Modeling Articles in March 1996 TVCG IS  2 SN  02721716 SP16 EP17 EPD  1617 A1  Nancy K. Hays, PY  1996 VL  16 JA  IEEE Computer Graphics and Applications ER   
Guest editors Jarek R. Rossignac of IBM's T.J. Watson Research Center and Christoph M. Hoffmann of Purdue University pulled together a collection of articles on solid modeling, drawing on presentations at an internationally known solid modeling symposium. The original plan was to publish a special section in the March 1996 issue of
"A Road Map to Solid Modeling," Christoph M. Hoffman and Jaroslaw R. Rossignac
The guest editors of this special issue provide the background of solid modeling, beginning with some mathematical foundations. They review the major representation schemata of solids, then characterize major layers of abstraction in a typical solid modeling system. The lowest level of abstraction comprises a substratum of basic service algorithms. At an intermediate level of abstraction are algorithms for larger, more conceptual operations. A yet higher level of abstraction presents a function view that typically targets solid design. The guest editors look at some applications and user interaction concepts. To conclude, they briefly explore trends in the field.
"VolumePreserving FreeForm Solids," Ari Rappoport, Alla Sheffer, and Michel Bercovier
Important trends in geometric modeling include the reliance on solid models rather than surfacebased models and the enhancement of the expressive power of models by using freeform objects in addition to the usual geometric primitives and by incorporating physical principles. Another trend is the emphasis on interactive performance.
The authors integrate all of these requirements in a single geometric primitive by endowing the trivariate tensor product freeform solid with several important physical properties, including volume and internal deformation energy. They present a novel method for modeling an object composed of several tensorproduct solids while preserving the desired volume of each primitive and ensuring highorder continuity constraints between the primitives. The method uses the Uzawa algorithm for nonlinear optimization, with objective functions based on deformation energy or least squares.
"Function Representation for Sweeping by a Moving Solid," A. Sourin and A. Pasko
The authors study a function representation of point sets swept by moving solids. The original solid generator is defined by an inequality greater than or equal to zero, based on Cartesian coordinates and time. This definition allows the inclusion of solids that change their shapes in time. Constructive solids can also be used as generators when described by Rfunctions. The trajectory of the generator can be defined in parametric form as movement of its local coordinate system. The authors did this with superposition of timedependent affine transformations. To get the function representation of the swept solid, they applied the concept of envelopes. They reduced the problem of swept solid description to a global extremum search by time.
"An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids," Evan C. Sherbrooke, Nicholas M. Patrikalakis, and Erik Brisson
The authors develop an algorithm for determining the Medial Axis Transform (MAT) for general 3D polyhedral solids of arbitrary genus without cavities, with nonconvex vertices and edges. The algorithm is based on a classification scheme that relates different pieces of the medial axis to one another even in the presence of degenerate medial axis points. The authors address representation of the medial axis and associated radius function, and give pseudocode for the algorithm along with recommended optimizations. Examples illustrate the algorithm's computational properties for convex and nonconvex 3D polyhedral solids with polyhedral holes.
"Shape Description by Medial Surface Construction," Damian J. Sheehy, Cecil G. Armstrong, and Desmond J. Robinson
The medial surface is a skeletal abstraction of a solid that provides useful shape information. The authors define the medial surface and its associated topological entities and present an algorithm for computing the medial surface of a large class of Brep solids. The algorithm is based on the domain Delaunay triangulation of a relatively sparse distribution of points generated on the object's boundary. This strategy is adaptive, in that the boundary point set is refined to guarantee a correct topological representation of the medial surface.
"Solving Geometric Constraints by Homotopy," H. Lamure and D. Michelucci
Geometric modeling by constraints yields systems of equations classically solved by NewtonRaphson's iteration, from a starting guess interactively provided by the designer. However, this method might fail to converge or might converge to an unwanted solution after "chaotic" behavior. This article claims that, in such cases, the homotopic method is much more satisfactory.
"A Fast Method for Estimating Discrete Field Values in Early Engineering Design," Jovan Zagajac
The author describes a fast method of computing estimates of field values at a few critical points. The method is based on an old technique—integrated partial differential equations through stochastic sampling—accelerated through the use of ray representations. In the preprocessing stage, the domain is coherently sampled to produce a rayrep. The second stage involves the usual stochastic sampling of the field, now enhanced by exploiting the semidiscrete character of rayreps. The method is relatively insensitive to the complexity of the shape being analyzed and has adjustable precision. Its mechanics and advantages are illustrated using Laplace's equation as an example.