We present a new algorithm, called marching cubes , that creates triangle models
of constant density surfaces from 3D medical data. Using a divide-and-conquer
approach to generate inter-slice connectivity, we create a case table that
defines triangle topology. The algorithm processes the 3D medical data in
scan-line order and calculates triangle vertices using linear interpolation. We
find the gra... hiện toàn bộ
The aggregate motion of a flock of birds, a herd of land animals, or a school of
fish is a beautiful and familiar part of the natural world. But this type of
complex motion is rarely seen in computer animation. This paper explores an
approach based on simulation as an alternative to scripting the paths of each
bird individually. The simulated flock is an elaboration of a particle systems,
with the... hiện toàn bộ
Demetri Terzopoulos, John Platt, Alan H. Barr, Kurt Fleischer
The theory of elasticity describes deformable materials such as rubber, cloth,
paper, and flexible metals. We employ elasticity theory to construct
differential equations that model the behavior of non-rigid curves, surfaces,
and solids as a function of time. Elastically deformable models are active: they
respond in a natural way to applied forces, constraints, ambient media, and
impenetrable obst... hiện toàn bộ
Hugues Hoppe, Tony DeRose, Tom Duchamp, John A. McDonald, Werner Stuetzle
We describe and demonstrate an algorithm that takes as input an unorganized set
of points {x l , . . . . x n } ⊂ R 3 on or near an unknown manifold M, and
produces as output a simplicial surface that approximates M. Neither the
topology, the presence of boundaries, nor the geometry of M are assumed to be
known in advance - all are inferred automatically from the data. This problem
naturally arises... hiện toàn bộ
In the course of developing a system for fitting smooth curves to camera input
we have developed several direct (i.e. noniterative) methods for fitting a shape
(line, circle, conic, cubic, plane, sphere, quadric, etc.) to a set of points,
namely exact fit, simple fit, spherical fit, and blend fit. These methods are
all dimension-independent, being just as suitable for 3D surfaces as for the 2D
cur... hiện toàn bộ
Juno is a system that harmoniously integrates a language for describing pictures
with a what-you-see-is-what-you-get image editor. Two of Juno's novelties are
that geometric constraints are used to specify locations, and that the text of a
Juno program is modified in response to the interactive editing of the displayed
image that the program produces.
A software environment is described which provides facilities at a variety of
levels for “animating” algorithms: exposing properties of programs by displaying
multiple dynamic views of the program and associated data structures. The system
is operational on a network of graphics-based, personal workstations and has
been used successfully in several applications for teaching and research in
compute... hiện toàn bộ
A process for creating repeating patterns of the hyperbolic plane is described.
Unlike the Euclidean plane, the hyperbolic plane has infinitely many different
kinds of repeating patterns. The Poincare circle model of hyperbolic geometry
has been used by the artist M. C. Escher to display interlocking, repeating,
hyperbolic patterns. A program has been designed which will do this
automatically. The... hiện toàn bộ
The mathematical description of three dimensional surfaces usually falls in one
of two classifications: parametric and algebraic. The form is defined as all
points which satisfy some equation: F(x,y,z)=0. This form is ideally suited for
image space shaded picture drawing, the pixel coordinates are substituted for x
and y and the equation is solved for z. Algorithms for drawing such objects have
be... hiện toàn bộ