News:

Sep 11, 2008 | Polygon data updated. "Random" orthogonal polygons have been added and all real-world polygons are counterclockwise oriented now. | |

Sep 11, 2008 | Documentation updated. | |

Sep 10, 2008 | The crossing number code from Real-Time Rendering (2nd ed.) has been added to the set of strategies |

*crossings**weiler**halfplane**barycentric**spackman*- PNPOLY
*csg*- RTR
- CGAL

For convenience our experiments make use of CGAL and
LEDA (note
that there is a LEDA free editon of LEDA available again which suffices for our purpose).
LEDA is used for correctness checking and visualisation of experimental results.
Thus, strictly speaking, you need both libraries in order to rerun the experiments.

computes
*per_edge* query points on each edge of the polygon defined by the point range [first, beyond) and reports these points via *res*. Points on the edges are generated using *CGAL::points_on_segment_2*. If we use double precision floating-point arithmetic to compute the points, they are not necessarily exactly on the edges. For each edge both the start point and the target point are among the generated query points.

computes
*per_diagonal* query points on each line segment that connects the first point of the polygon with another point on the polygon and reports these points via *res*. Points on these "diagonals" are generated using *CGAL::points_on_segment_2*. If we use double precision floating-point arithmetic to compute the points, they are not necessarily exactly on the edges. For each edge both the start point and the target point are among the generated query points.

computes
*per_crossline* query points on both the horizontal and the vertical line through each vertex, more precisely, on the intersection of these lines with the unit square, and reports these points via *res*. Points on these horizontal and vertical segments are generated using *CGAL::points_on_segment_2*.

computes
*per_egde* query points on the intersection segment of the lines supporting the polygon edges with the unit square and reports these points via *res*. Points on these horizontal and vertical segments are generated using *CGAL::points_on_segment_2*. If we use double precision floating-point arithmetic to compute the points, they are not necessarily exactly on the lines.

- ReliabilityExperiments.lw (Lweb source)
- ReliabilityExperiments.nw (noweb source -- if you don't have the LEDA tools)
- Documentation

This page is always under construction!