summaryrefslogtreecommitdiff
path: root/basegfx/source/range/b2drangeclipper.cxx
diff options
context:
space:
mode:
Diffstat (limited to 'basegfx/source/range/b2drangeclipper.cxx')
-rw-r--r--basegfx/source/range/b2drangeclipper.cxx8
1 files changed, 4 insertions, 4 deletions
diff --git a/basegfx/source/range/b2drangeclipper.cxx b/basegfx/source/range/b2drangeclipper.cxx
index c29b26cefbad..33a81beaecce 100644
--- a/basegfx/source/range/b2drangeclipper.cxx
+++ b/basegfx/source/range/b2drangeclipper.cxx
@@ -40,7 +40,7 @@ namespace basegfx
namespace
{
// Generating a poly-polygon from a bunch of rectangles
- //
+
// Helper functionality for sweep-line algorithm
// ====================================================
@@ -882,17 +882,17 @@ namespace basegfx
// sweep-line algorithm to generate a poly-polygon
// from a bunch of rectangles
// ===============================================
- //
+
// This algorithm uses the well-known sweep line
// concept, explained in every good text book about
// computational geometry.
- //
+
// We start with creating two structures for every
// rectangle, one representing the left x coordinate,
// one representing the right x coordinate (and both
// referencing the original rect). These structs are
// sorted with increasing x coordinates.
- //
+
// Then, we start processing the resulting list from
// the beginning. Every entry in the list defines a
// point in time of the line sweeping from left to