diff options
author | Alexander Wilms <f.alexander.wilms@gmail.com> | 2014-02-25 17:40:34 +0100 |
---|---|---|
committer | Thorsten Behrens <thb@documentfoundation.org> | 2014-02-25 21:35:51 +0100 |
commit | a96d7ce3904f4dfd08d47170e926b15b5f7dae3d (patch) | |
tree | e6b273b3bc3fb9c485b7caf734f20ccb49461f24 /basegfx/source/range | |
parent | 8747200c87afa81177f2da8ec9bd46996156c307 (diff) |
Remove visual noise from basegfx
Change-Id: I9a28405ab92605203ec380f89f5aee91f042d91a
Diffstat (limited to 'basegfx/source/range')
-rw-r--r-- | basegfx/source/range/b2drangeclipper.cxx | 8 |
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 |