118 lines
3.9 KiB
C++
118 lines
3.9 KiB
C++
// Copyright (c) 2006,2007,2009,2010,2011 Tel-Aviv University (Israel).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org).
|
|
//
|
|
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Arrangement_on_surface_2/include/CGAL/Arr_naive_point_location.h $
|
|
// $Id: Arr_naive_point_location.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot
|
|
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
|
|
//
|
|
//
|
|
// Author(s) : Ron Wein <wein@post.tau.ac.il>
|
|
// (based on old version by Eyal Flato)
|
|
// Efi Fogel <efif@post.tau.ac.il>
|
|
|
|
#ifndef CGAL_ARR_NAIVE_POINT_LOCATION_H
|
|
#define CGAL_ARR_NAIVE_POINT_LOCATION_H
|
|
|
|
#include <CGAL/license/Arrangement_on_surface_2.h>
|
|
|
|
#include <CGAL/disable_warnings.h>
|
|
|
|
#include <CGAL/Arr_point_location_result.h>
|
|
#include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
|
|
|
|
/*! \file
|
|
* Definition of the Arr_naive_point_location<Arrangement> template.
|
|
*/
|
|
|
|
namespace CGAL {
|
|
|
|
/*! \class
|
|
* A class that answers point-location and vertical ray-shooting queries
|
|
* on a 2D arrangement using a naive algorithm.
|
|
* The Arrangement parameter corresponds to an arrangement instantiation
|
|
* of type Arrangement_on_surface_2<GeomTraits, TopTraits>.
|
|
*/
|
|
template <class Arrangement_>
|
|
class Arr_naive_point_location {
|
|
public:
|
|
typedef Arrangement_ Arrangement_2;
|
|
typedef typename Arrangement_2::Geometry_traits_2 Geometry_traits_2;
|
|
typedef typename Arrangement_2::Topology_traits Topology_traits;
|
|
|
|
typedef typename Arrangement_2::Vertex_const_handle Vertex_const_handle;
|
|
typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
|
|
typedef typename Arrangement_2::Face_const_handle Face_const_handle;
|
|
|
|
typedef typename Geometry_traits_2::Point_2 Point_2;
|
|
typedef typename Geometry_traits_2::X_monotone_curve_2 X_monotone_curve_2;
|
|
|
|
typedef Arr_point_location_result<Arrangement_2> Result;
|
|
typedef typename Result::Type Result_type;
|
|
|
|
// Support cpp11::result_of
|
|
typedef Result_type result_type;
|
|
|
|
protected:
|
|
typedef Arr_traits_basic_adaptor_2<Geometry_traits_2> Traits_adaptor_2;
|
|
|
|
// Data members:
|
|
const Arrangement_2* p_arr; // The associated arrangement.
|
|
const Traits_adaptor_2* geom_traits; // Its associated geometry traits.
|
|
const Topology_traits* top_traits; // Its associated topology traits.
|
|
|
|
template<typename T>
|
|
Result_type make_result(T t) const { return Result::make_result(t); }
|
|
inline Result_type default_result() const { return Result::default_result(); }
|
|
|
|
public:
|
|
/*! Default constructor. */
|
|
Arr_naive_point_location() :
|
|
p_arr(nullptr),
|
|
geom_traits(nullptr),
|
|
top_traits(nullptr)
|
|
{}
|
|
|
|
/*! Constructor given an arrangement. */
|
|
Arr_naive_point_location(const Arrangement_2& arr) : p_arr(&arr)
|
|
{
|
|
geom_traits = static_cast<const Traits_adaptor_2*>(p_arr->geometry_traits());
|
|
top_traits = p_arr->topology_traits();
|
|
}
|
|
|
|
/*! Attach an arrangement object. */
|
|
void attach(const Arrangement_2& arr)
|
|
{
|
|
p_arr = &arr;
|
|
geom_traits = static_cast<const Traits_adaptor_2*>(p_arr->geometry_traits());
|
|
top_traits = p_arr->topology_traits();
|
|
}
|
|
|
|
/*! Detach from the current arrangement object. */
|
|
void detach()
|
|
{
|
|
p_arr = nullptr;
|
|
geom_traits = nullptr;
|
|
top_traits = nullptr;
|
|
}
|
|
|
|
/*!
|
|
* Locate the arrangement feature containing the given point.
|
|
* \param p The query point.
|
|
* \return An object representing the arrangement feature containing the
|
|
* query point. This object is either a Face_const_handle or a
|
|
* Halfedge_const_handle or a Vertex_const_handle.
|
|
*/
|
|
Result_type locate(const Point_2& p) const;
|
|
};
|
|
|
|
} //namespace CGAL
|
|
|
|
// The member-function definitions can be found under:
|
|
#include <CGAL/Arr_point_location/Arr_naive_point_location_impl.h>
|
|
|
|
#include <CGAL/enable_warnings.h>
|
|
|
|
#endif
|