Skip to content

Add poisson disk sampling as an option to PMP::sample_triangle_mesh #9067

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: main
Choose a base branch
from
Open

Add poisson disk sampling as an option to PMP::sample_triangle_mesh #9067

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
194bd36
add a way to get the item where the random points was picked
sloriot Sep 12, 2025
49b980a
rename class to match naming conventions
sloriot Sep 12, 2025
f9f9327
document existing classes not documented
sloriot Sep 12, 2025
7898a5c
cosmetic
sloriot Sep 12, 2025
48f8bfb
import poisson disk sampling from Brad's branch:
sloriot Sep 12, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
61 changes: 53 additions & 8 deletions Generator/doc/Generator/CGAL/point_generators_2.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -184,9 +184,12 @@ typedef const Point_2* pointer;
*/
typedef const Point_2& reference;

/// @}
/// \name Function
/// @{

/*!
Creates an input iterator `g` generating points of type `Point_2` uniformly
creates an input iterator `g` generating points of type `Point_2` uniformly
distributed in the open disc with radius \f$ r\f$,
i.e.\ \f$ |*g| < r\f$. Two random numbers are needed from
`rnd` for each point.
Expand Down Expand Up @@ -246,10 +249,12 @@ typedef const Point_2* pointer;
*/
typedef const Point_2& reference;


/// @}
/// \name Function
/// @{

/*!
Creates an input iterator `g` generating points of type `Point_2` uniformly
creates an input iterator `g` generating points of type `Point_2` uniformly
distributed in the half-open square with side length \f$ 2 a\f$, centered
at the origin, i.e.\ \f$ \forall p = *g: -a \le p.x() < a\f$ and
\f$ -a \le p.y() < a\f$.
Expand Down Expand Up @@ -310,8 +315,13 @@ typedef const Point_2* pointer;

*/
typedef const Point_2& reference;

/// @}
/// \name Functions
/// @{

/*!
Creates an input iterator `g` generating points of type `Point_2` uniformly
creates an input iterator `g` generating points of type `Point_2` uniformly
distributed inside the triangle with vertices \f$ p, q \f$ and \f$ r \f$, i.e., \f$*g = \alpha p + \beta q + \gamma r \f$, for some
\f$ \alpha, \beta, \gamma \in [0, 1] \f$ and \f$ \alpha + \beta + \gamma = 1 \f$.
Two random numbers are needed from `rnd` for each point.
Expand All @@ -321,7 +331,7 @@ typedef const Point_2& reference;
get_default_random() );

/*!
Creates an input iterator `g` generating points of type `Point_2` uniformly
creates an input iterator `g` generating points of type `Point_2` uniformly
distributed inside a triangle \f$t\f$ with vertices \f$ p, q \f$ and \f$ r \f$, i.e., \f$*g = \alpha p + \beta q + \gamma r \f$, for some
\f$ \alpha, \beta, \gamma \in [0, 1] \f$ and \f$ \alpha + \beta + \gamma = 1 \f$.
Two random numbers are needed from `rnd` for each point.
Expand Down Expand Up @@ -390,14 +400,26 @@ typedef const Point_2& reference;
*/
typedef const Point_2& reference;

/// @}

/// \name Functions
/// @{

/*!
Creates an input iterator `g` generating points of type `Point_2` uniformly
creates an input iterator `g` generating points of type `Point_2` uniformly
distributed between the triangles of the triangulation. Each triangle has a probability to be chosen to hold the point depending on its area.

*/
Random_points_in_triangle_mesh_2(const Triangulation& triangulation, Random& rnd =
get_default_random() );

/*!
returns a face containing the last point generated.
\pre a point must have been generated before calling the function
*/
typename Triangulation::Face_handle
last_item_picked() const;

/// @}

}; /* end Random_points_in_triangle_mesh_2 */
Expand Down Expand Up @@ -455,15 +477,27 @@ get_default_random() );
*/
typedef const Point_2& reference;

/// @}

/// \name Functions
/// @{

/*!
Creates an input iterator `g` generating points of type `Point_2` uniformly
creates an input iterator `g` generating points of type `Point_2` uniformly
distributed between the triangles of the range. Each triangle has a probability to be chosen to hold the point depending on its area.

*/
template<typename TriangleRange>
Random_points_in_triangles_2(const TriangleRange& triangles, Random& rnd =
get_default_random() );

/*!
returns the address of an input triangle containing the last point generated.
\pre a point must have been generated before calling the function
*/
const Triangle_2*
last_item_picked() const;

/// @}

}; /* end Random_points_in_triangles_2 */
Expand Down Expand Up @@ -519,6 +553,9 @@ typedef const Point_2* pointer;
*/
typedef const Point_2& reference;

/// @}
/// \name Function
/// @{

/*!
creates an input iterator `g` generating points of type `Point_2` uniformly
Expand Down Expand Up @@ -584,6 +621,9 @@ typedef const Point_2* pointer;
*/
typedef const Point_2& reference;

/// @}
/// \name Function
/// @{

/*!
creates an input iterator `g` generating points of type `Point_2` uniformly
Expand Down Expand Up @@ -649,6 +689,9 @@ typedef const Point_2* pointer;
*/
typedef const Point_2& reference;

/// @}
/// \name Function
/// @{

/*!
creates an input iterator `g` generating points of type `Point_2` uniformly
Expand Down Expand Up @@ -717,7 +760,9 @@ typedef const Point_2* pointer;
*/
typedef const Point_2& reference;


/// @}
/// \name Functions
/// @{

/*!
creates an input iterator `g` generating points of type `P` equally
Expand Down
Loading
Loading