CCVT_REFLECT
Constrained CVT Algorithm

CCVT_REFLECT is a MATLAB program which allows the user to specify certain parameters, and then creates a Centroidal Voronoi Tessellation of points in a region, using a special reflection technique to try to attract some points to move to the boundary.

The standard CVT algorithm will tend to place points uniformly inside the region, but will never place points on the boundary. However, in many cases, it would be very desirable to smoothly modify the set of points so that some of them fall on the boundary. This is the case, for instance, when the points are to be used to triangulate the region and define a finite element grid.

The method for doing this relies on the observation that the generator points become uniformly distributed because they "push" each other away, by grabbing sample points. The generator points do not approach the boundary too closely, because there are no sample points on the other side of the boundary. In essence, the boundary also "pushes" the generator points away. By making "reflected" sample points whenever a generator is near the boundary, we essentially neutralize the boundary effect, allowing the generator points in the interior to push a layer of generators onto the boundary. In most cases, once a point hits the boundary, it will not leave, although it may continue to adjust its position on the boundary itself.

This program is a "work in progress". Currently, only a simple 2D box region has been examined. The next step is to work on more general 2D regions; then to make the natural extension to 3D or arbitrary dimension.

CCVT_REFLECT is an experimental code; so far, the experiment is not doing well. I haven't figured out yet how to make the points behave as well as they do for CCVT_BOX. The idea is, though, that the method of pulling points to the boundary seems fairly natural and flexible to me, so maybe I just need to find the right way to implement it.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Related Data and Programs:

CCVT_BOX, a MATLAB program which solves a similar problem on a box.

CVT_1D_LLOYD, a MATLAB program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the interval [0,1], under a uniform density.

CVT_1D_SAMPLING, a MATLAB program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the interval [0,1], under a uniform density, using sampling to estimate the Voronoi regions.

Reference:

1. Franz Aurenhammer,
   Voronoi diagrams - a study of a fundamental geometric data structure,
   ACM Computing Surveys,
   Volume 23, Number 3, September 1991, pages 345-405.
2. John Burkardt, Max Gunzburger, Janet Peterson, Rebecca Brannon,
   User Manual and Supporting Information for Library of Codes for Centroidal Voronoi Placement and Associated Zeroth, First, and Second Moment Determination,
   Sandia National Laboratories Technical Report SAND2002-0099,
   February 2002.
3. Qiang Du, Vance Faber, Max Gunzburger,
   Centroidal Voronoi Tessellations: Applications and Algorithms,
   SIAM Review,
   Volume 41, Number 4, December 1999, pages 637-676.
4. Qiang Du, Max Gunzburger, Lili Ju,
   Meshfree, Probabilistic Determination of Point Sets and Support Regions for Meshfree Computing,
   Computer Methods in Applied Mechanics in Engineering,
   Volume 191, 2002, pages 1349-1366.
5. Lili Ju, Qiang Du, Max Gunzburger,
   Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations,
   Parallel Computing,
   Volume 28, 2002, pages 1477-1500.

Source Code:

• ccvt_reflect.m gets information from the user, creates the CVT using reflection, and saves the animation.
• ch_cap.m capitalizes a single character.
• cvt_energy.m computes the CVT energy of a dataset.
• cvt_sample.m returns sample points.
• cvt_write.m writes a CVT dataset to a file.
• data_read.m reads data from a file.
• file_exist.m is true if a file exists.
• file_delete.m deletes a file.
• find_closest.m finds the Voronoi cell generator closest to a point X.
• get_seed.m returns a seed for the random number generator.
• halham_leap_check.m checks LEAP for a Halton or Hammersley sequence.
• halham_n_check.m checks N for a Halton or Hammersley sequence.
• halham_dim_num_check.m checks NDIM for a Halton or Hammersley sequence.
• halham_seed_check.m checks SEED for a Halton or Hammersley sequence.
• halham_step_check.m checks STEP for a Halton or Hammersley sequence.
• halton_base_check.m checks BASE for a Halton sequence.
• i4_to_halton_sequence.m next N elements of an NDIM-dimensional Halton sequence
• mpb.m replaces points near the boundary by their projections on the boundary.
• points_eps.m make an EPS plot of the generators.
• prime.m returns the N-th prime number.
• r8_huge.m returns a "huge" R8.
• r8mat_transpose_print.m prints the transpose of an R8MAT, with an optional title.
• r8mat_transpose_print_some.m prints the transpose of some of an R8MAT, with an optional title.
• r8mat_uniform_01.m returns a unit pseudorandom R8MAT.
• random_initialize.m initializes the MATLAB random number seed.
• s_eqi.m is TRUE if two strings are equal, ignoring case.
• s_len_trim.m returns the length of a string to the last nonblank.
• timestamp.m prints the current YMDHMS date as a timestamp.
• tuple_next_fast.m computes the next element of a tuple space, "fast".

You can go up one level to the MATLAB source codes.