cgal/Apollonius_graph_2/examples/Apollonius_graph_2
Menelaos Karavelas 30dd79e8cb Update ag2_exact_traits_sqrt.cpp
[Apollonius_graph_2][examples] add warnings (in the form of comments)
indicating that an exact kernel should not be chosen when efficiency is an issue.
2015-04-02 08:32:07 +03:00
..
data
README gave the example files some more meaningful names 2006-03-08 22:49:31 +00:00
ag2_exact_traits.cpp Update ag2_exact_traits.cpp 2015-04-02 08:29:52 +03:00
ag2_exact_traits_sqrt.cpp Update ag2_exact_traits_sqrt.cpp 2015-04-02 08:32:07 +03:00
ag2_filtered_traits_no_hidden.cpp No need to #include <CGAL/basic.h> 2011-03-13 17:06:06 +00:00
ag2_hierarchy.cpp No need to #include <CGAL/basic.h> 2011-03-13 17:06:06 +00:00

README

This is the examples directory for the Apollonius_graph_2 package
There are 4 example programs in this directory. Each one of these is
aimed at describing a different usage for the Apollonius_graph_2
package. In particular:

* ag2_exact_traits.C: a very basic example. It uses an exact number
  type that supports ring operations to achieve robustness.

* ag2_exact_traits_sqrt.C: it shows how to change the method the predicates
  are evaluated. By default the predicates use only the operations +,-,*
  and these are the only operations that is assumed they are exact. In
  this example we show how to change that and how to define the traits
  class so that the operations +,-,*,/,sqrt are used and are assumed
  exact. Again an exact number type is used as the number type.

* ag2_filtered_traits_no_hidden.C: a variation of the first example. The
  filtered traits are now used instead of and exact number type. We also
  show how to use another parameter for the algorithm, namely the one
  that indicates whether hidden weighted points are to be stored or not.

* ag2_hierarchy.C: same as the previous example except the fact that now
  we store the hidden weighted points and on top of that we use a
  hierarchy of Apollonius graphs.