CGAL 3.7 Released, Computational Geometry Algorithms Library



  • 1. Spatial indexing for flat files
    hi all, Currently i m into a project of GIS which involves spatial indexing. I am using the binary flat files to store the spatial data.I m not using any conventional database like ORACLE,SQL Server etc. Since i do not have any idea about the spatial indexing,its types and which is the most commonly used spatial indexing. Would be keenly waiting for replies from u guys. Thanks Yogi
  • 2. Solid Geometry : The Fundamentals and Beyond
    Interactive Computer Graphics and Computer-Aided Geometric Design(CAGD)rely upon Geometry(Plane/2D and Solid/3d) for implementation. Therefore, a student wishing to major in one of those subjects needs a firm understanding of the fundamentals of Solid Geometry while Planar/2D Geometry is generally assumed to have been covered at the high school level. Most books tend to neglect 3D Geometry rather focussing on Lines, Planes etc etc. What would be a good set of books that cover the Geometry of Three Dimensions while also providing some material on the transition from 2D Geometry with a focus on : i) The visual aspect of Solid Geometry. (most texts tend to restrict themselves to "solving equations") ii) Exploratory Examples(as opposed to Exercises without solutions!) iii) Formal proof and thought. iv) Pointers to further study instead of greedy/hurried amalgamation of "all concepts in one" book.
  • 3. polygon mirror made by lincoln laser co.365mm laser scan lens, from omitec to sell
    hi i got a lot about 20 -30 pcs polygon mirror made by lincoln laser co. interest party pls give me a offer, i can get you photo for detail, and i can list it in ebay in case you want to be sure, (ps i will sell it in any price, just offer me please) goods locate in hong kong i also got some 365mm laser scan lens, from omitec ,beam expander in case yu got use of it, you will save a lot of $$ my email XXXX@XXXXX.COM
  • 4. distance distribution between similar images
    If two images are identical except for white noise, what is the distribution of the distance (which may be Euclidean, Mahalanobis or city block) between the two? Or, another way of putting it is: If I have two images that are just white noise, what is the distribution of the distance between the two? I would greatly appreciate it if someone can answer the above questions or offer any suggestions as to where I can find information pertaining to this. Thanks, Rabia
  • 5. cubic b-splines
    Hi, Can somebody point to an algorithm for drawing cubic b-splines (with subdivision method)? What I basically need is the split matrix for cubic b-splines, I can figure out the algorithm myself. thanks, -g

CGAL 3.7 Released, Computational Geometry Algorithms Library

Postby Laurent Rineau » Tue, 19 Oct 2010 18:59:28 GMT

The CGAL Open Source Project is pleased to announce the Release 3.7
of CGAL, the Computational Geometry Algorithms Library.

CGAL-3.7 provides improvements and fixes to existing packages, and
for new compilers.
See  http://www.**--****.com/ 

The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations, Delaunay
triangulations in
  2D and 3D, periodic Delaunay triangulations in 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
  Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generations)
  and processing (surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
  range and segment trees),
- interpolation (natural neighbor interpolation and placement of
- optimization algorithms (smallest enclosing sphere of points or
  spheres, smallest enclosing ellipsoid of points, principal
  component analysis),
- kinetic data structures

Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory ( http://www.**--****.com/ ).

For further information and for downloading the library and its
documentation, please visit the CGAL web site:  http://www.**--****.com/ 

Re: CGAL 3.7 Released, Computational Geometry Algorithms Library

Postby Bob » Wed, 20 Oct 2010 02:46:02 GMT

On Oct 18, 2:59m, Laurent Rineau

Thanks, this is a great resource.

See also the book, "Geometric tools for computer graphics" by P.J.
Schneider and D.H. Eberly

Re: CGAL 3.7 Released, Computational Geometry Algorithms Library

Postby YoungMin » Fri, 22 Oct 2010 00:15:33 GMT

thanks a lot!

Return to graphics


Who is online

Users browsing this forum: No registered users and 80 guest