226
CHAPTER
5.
ELEMENTS
OF
DIFFERENTIAL GEOMETRY
Figur e
5.13
Parameterizing
a
discrete
curve.
5.5
Discrete
modeling
In
practice,
if a
discrete approach
is
used
for
modeling curves
and
surfaces (see
chapter
1),
these geometric objects
are
denned
by
ID
and 2D
graphs
£7(0,
N)
whose
nodes
{PI,PI,
• •
-,PM)
nave
given locations
in the 3D
space:
• In the
case
of a
discrete
curve,
the
graph
C?(f2,
N)
can be
decomposed
into
a
series
of
adjacent
arcs
E(p
i
,p
i+l
).
• In the
case
of a
discrete
surface,
the
graph
C?(f2,
AT)
can be
decomposed into
a set of
adjacent
triangles
T(p
i
,
Pj,p
k
),
rectangles
R(p^
Pj,p
k
,
p/J,
or,
more
generally,
polygons.
The
parametric equations
of
these arcs, triangles,
or
rectangles
are
unknown,
and the
only information available
is the
location
of
their vertices. Prom this
limited information,
it is
possible
to
build complex parametric regular curves
and
surfaces. Chapter
7
describes
how
this goal
can be
achieved.
These
parametric models
are
based
on
algebraic equations,
and all the
derivatives
used
in
differential
geometry
can
easily
be
computed.
This section will show
that
these derivatives
and
differential
properties
can
be
approximated directly using
finite
differences
without having
to
build such
complex algebraic models.
5.5.1
Consider
a
discrete curve
defined
by a
series
of
nodes
(p
0
,...,
PM}-
As
SU
S~
gested
in figure
(5.13),
it
will
be
assumed
that
the
regular (unknown) curve
interpolating these nodes
is
represented
by an
unknown parameterization
x(i)
such
that
By
definition, such
a
discrete
curve
is
said
to be
regular
if the two
following
conditions
are
satisfied
for any
node
p^:
• the
angle
9(p
i
)
between
(Pi_i
—
pj
and
(p
i+1
—
pj
is
close
to
TT,
and
• the
segments
(p
i+1
—
Pj)
have,
at
least
locally,
approximately
the
same
length.
In
practice, these regularity conditions
are
generally satisfied
if the
arcs
are
small enough
and the
geometry
of the
discrete curve
has
been determined
using
the
DSI
algorithm.
Regular discrete curves