Meeting 12: Degeneracy & Robust Predicates

We have so far surveyed many fundamental data structures, their
construction and use.  As we have seen, the construction algorithms
can almost always be formulated in terms of one or a small number
of geometric predicates, which combine geometric data to produce
a binary or ternary result.  We have not, until today, looked closely
at the inner operation of these predicates.
 

Presenters:

Marek Teichmann

Readings:

• 1
• 2

• 1
• 2

• 1
• A
• B
• 2

• in 1:
• in 2:
• in 3:

• 1
• 2

Next Meeting

Last Meeting .... Next Meeting .... Course Page .... Meeting Schedule

Created: Feb 1998