FM / cartesian

/usr/include/boost/geometry/strategies/cartesian/

/usr/include/boost/geometry/strategies/cartesian

Name	Size	Mode	Actions
area.hpp	3958	0644	edit dl rm
area_surveyor.hpp	1221	0644	edit dl rm
azimuth.hpp	1212	0644	edit dl rm
box_in_box.hpp	10614	0644	edit dl rm
buffer_end_flat.hpp	3757	0644	edit dl rm
buffer_end_round.hpp	6084	0644	edit dl rm
buffer_join_miter.hpp	4540	0644	edit dl rm
buffer_join_round.hpp	6206	0644	edit dl rm
buffer_join_round_by_divide.hpp	4659	0644	edit dl rm
buffer_point_circle.hpp	4016	0644	edit dl rm
buffer_point_square.hpp	3654	0644	edit dl rm
buffer_side_straight.hpp	4587	0644	edit dl rm
centroid_average.hpp	2880	0644	edit dl rm
centroid_bashein_detmer.hpp	8541	0644	edit dl rm
centroid_weighted_length.hpp	4855	0644	edit dl rm
densify.hpp	3902	0644	edit dl rm
disjoint_box_box.hpp	2985	0644	edit dl rm
disjoint_segment_box.hpp	8965	0644	edit dl rm
distance_projected_point.hpp	9635	0644	edit dl rm
distance_projected_point_ax.hpp	9835	0644	edit dl rm
distance_pythagoras.hpp	7674	0644	edit dl rm
distance_pythagoras_box_box.hpp	8993	0644	edit dl rm
distance_pythagoras_point_box.hpp	9230	0644	edit dl rm
distance_segment_box.hpp	6893	0644	edit dl rm
envelope.hpp	4299	0644	edit dl rm
envelope_box.hpp	3479	0644	edit dl rm
envelope_multipoint.hpp	1442	0644	edit dl rm
envelope_point.hpp	2963	0644	edit dl rm
envelope_segment.hpp	2458	0644	edit dl rm
expand_box.hpp	1868	0644	edit dl rm
expand_point.hpp	3340	0644	edit dl rm
expand_segment.hpp	1900	0644	edit dl rm
index.hpp	6976	0644	edit dl rm
intersection.hpp	30855	0644	edit dl rm
io.hpp	1873	0644	edit dl rm
line_interpolate.hpp	3772	0644	edit dl rm
point_in_box.hpp	8761	0644	edit dl rm
point_in_point.hpp	3543	0644	edit dl rm
point_in_poly_crossings_multiply.hpp	3593	0644	edit dl rm
point_in_poly_franklin.hpp	3464	0644	edit dl rm
point_in_poly_winding.hpp	9889	0644	edit dl rm
point_order.hpp	1024	0644	edit dl rm
side_by_triangle.hpp	9669	0644	edit dl rm
turn_in_ring_winding.hpp	7463	0644	edit dl rm

Edit: /usr/include/boost/geometry/strategies/cartesian/buffer_point_circle.hpp (4016B)

// Boost.Geometry (aka GGL, Generic Geometry Library)

// This file was modified by Oracle on 2015, 2018.
// Modifications copyright (c) 2015, 2018, Oracle and/or its affiliates.

// Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle

// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

#ifndef BOOST_GEOMETRY_STRATEGIES_CARTESIAN_BUFFER_POINT_CIRCLE_HPP
#define BOOST_GEOMETRY_STRATEGIES_CARTESIAN_BUFFER_POINT_CIRCLE_HPP

#include <cstddef>

#include <boost/range/value_type.hpp>

#include <boost/geometry/core/access.hpp>
#include <boost/geometry/core/coordinate_type.hpp>

#include <boost/geometry/strategies/buffer.hpp>

#include <boost/geometry/util/math.hpp>
#include <boost/geometry/util/select_most_precise.hpp>

namespace boost { namespace geometry
{

namespace strategy { namespace buffer
{

/*!
\brief Create a circular buffer around a point
\ingroup strategies
\details This strategy can be used as PointStrategy for the buffer algorithm.
    It creates a circular buffer around a point. It can be applied
    for points and multi_points, but also for a linestring (if it is degenerate,
    so consisting of only one point) and for polygons (if it is degenerate).
    This strategy is only applicable for Cartesian coordinate systems.

\qbk{
[heading Example]
[buffer_point_circle]
[heading Output]
[$img/strategies/buffer_point_circle.png]
[heading See also]
\* [link geometry.reference.algorithms.buffer.buffer_7_with_strategies buffer (with strategies)]
\* [link geometry.reference.strategies.strategy_buffer_point_square point_square]
\* [link geometry.reference.strategies.strategy_buffer_geographic_point_circle geographic_point_circle]
}
 */
class point_circle
{
public :
    //! \brief Constructs the strategy
    //! \param count number of points for the created circle (if count
    //! is smaller than 3, count is internally set to 3)
    explicit point_circle(std::size_t count = 90)
        : m_count((count < 3u) ? 3u : count)
    {}

#ifndef DOXYGEN_SHOULD_SKIP_THIS
    //! Fills output_range with a circle around point using distance_strategy
    template
    <
        typename Point,
        typename OutputRange,
        typename DistanceStrategy
    >
    inline void apply(Point const& point,
                DistanceStrategy const& distance_strategy,
                OutputRange& output_range) const
    {
        typedef typename boost::range_value<OutputRange>::type output_point_type;

typedef typename geometry::select_most_precise
            <
                typename geometry::select_most_precise
                    <
                        typename geometry::coordinate_type<Point>::type,
                        typename geometry::coordinate_type<output_point_type>::type
                    >::type,
                double
            >::type promoted_type;

promoted_type const buffer_distance = distance_strategy.apply(point, point,
                        strategy::buffer::buffer_side_left);

promoted_type const two_pi = geometry::math::two_pi<promoted_type>();

promoted_type const diff = two_pi / promoted_type(m_count);
        promoted_type a = 0;

for (std::size_t i = 0; i < m_count; i++, a -= diff)
        {
            output_point_type p;
            set<0>(p, get<0>(point) + buffer_distance * cos(a));
            set<1>(p, get<1>(point) + buffer_distance * sin(a));
            output_range.push_back(p);
        }

// Close it:
        output_range.push_back(output_range.front());
    }
#endif // DOXYGEN_SHOULD_SKIP_THIS

private :
    std::size_t m_count;
};

}} // namespace strategy::buffer

}} // namespace boost::geometry

#endif // BOOST_GEOMETRY_STRATEGIES_CARTESIAN_BUFFER_POINT_CIRCLE_HPP

// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2012-2015 Barend Gehrels, Amsterdam, the Netherlands. // This file was modified by Oracle on 2015, 2018. // Modifications copyright (c) 2015, 2018, Oracle and/or its affiliates. // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle // Use, modification and distribution is subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_GEOMETRY_STRATEGIES_CARTESIAN_BUFFER_POINT_CIRCLE_HPP #define BOOST_GEOMETRY_STRATEGIES_CARTESIAN_BUFFER_POINT_CIRCLE_HPP #include #include #include #include #include #include #include namespace boost { namespace geometry { namespace strategy { namespace buffer { /*! \brief Create a circular buffer around a point \ingroup strategies \details This strategy can be used as PointStrategy for the buffer algorithm. It creates a circular buffer around a point. It can be applied for points and multi_points, but also for a linestring (if it is degenerate, so consisting of only one point) and for polygons (if it is degenerate). This strategy is only applicable for Cartesian coordinate systems. \qbk{ [heading Example] [buffer_point_circle] [heading Output] [$img/strategies/buffer_point_circle.png] [heading See also] \* [link geometry.reference.algorithms.buffer.buffer_7_with_strategies buffer (with strategies)] \* [link geometry.reference.strategies.strategy_buffer_point_square point_square] \* [link geometry.reference.strategies.strategy_buffer_geographic_point_circle geographic_point_circle] } */ class point_circle { public : //! \brief Constructs the strategy //! \param count number of points for the created circle (if count //! is smaller than 3, count is internally set to 3) explicit point_circle(std::size_t count = 90) : m_count((count < 3u) ? 3u : count) {} #ifndef DOXYGEN_SHOULD_SKIP_THIS //! Fills output_range with a circle around point using distance_strategy template < typename Point, typename OutputRange, typename DistanceStrategy > inline void apply(Point const& point, DistanceStrategy const& distance_strategy, OutputRange& output_range) const { typedef typename boost::range_value::type output_point_type; typedef typename geometry::select_most_precise < typename geometry::select_most_precise < typename geometry::coordinate_type::type, typename geometry::coordinate_type::type >::type, double >::type promoted_type; promoted_type const buffer_distance = distance_strategy.apply(point, point, strategy::buffer::buffer_side_left); promoted_type const two_pi = geometry::math::two_pi(); promoted_type const diff = two_pi / promoted_type(m_count); promoted_type a = 0; for (std::size_t i = 0; i < m_count; i++, a -= diff) { output_point_type p; set<0>(p, get<0>(point) + buffer_distance * cos(a)); set<1>(p, get<1>(point) + buffer_distance * sin(a)); output_range.push_back(p); } // Close it: output_range.push_back(output_range.front()); } #endif // DOXYGEN_SHOULD_SKIP_THIS private : std::size_t m_count; }; }} // namespace strategy::buffer }} // namespace boost::geometry #endif // BOOST_GEOMETRY_STRATEGIES_CARTESIAN_BUFFER_POINT_CIRCLE_HPP