Top : Science : Math : Geometry : Computational Geometry :
Software
Websites
Ken ClarkSon's convex hulls, Delaunay triangulations, alpha shapes calculator in C
site exerpt
hull convex hulls, Delaunay triangulations, alpha shapes A program for convex hulls Summary Source Code Examples of use Synopsis Description Bugs/Portability Author Algorithms Function call Summary Hull is an ANSI C program that computes the convex hull of a point set in general (but small dimension. The...GDSII viewer + Algorithms for 2d polygon boolean operations, C++ source code
site exerpt
Polygon Boolean operations on sets of polygons This page is first released 1-01-98 Last Page Update: 28-11-2002 Boolean: GDSII viewer/editor boolean) operations on sets of 2d polygons. Statistics Operations (some) original merge a-b b-a intersect exor makering negative_cor positive_cor Index Introduction screenshots Copyright? C source, executables and...Jeff Erickson's links to freely available implementations of geometric algorithms and software.
site exerpt
Computational Geometry Code This page lists small pieces of geometric software available on the Internet. Most of the software is available free of charge. Unless otherwise specified, C or C source code is available for all programs. Software libraries and collections and programs...By Martin Held. Copes with polygons with holes and degeneracies/self-intersections; based on repeatedly clipping ears. Source code on request.
site exerpt
FIST: Fast Industrial-Strength Triangulation The triangulation of a polygon is a basic building block for many graphics applications. For instance, high-speed rendering typically relies on polygonal and curved surfaces being subdivided into triangles that can be handled efficiently by the graphics hardware. Triangulating a...Mesh generation in 2D and 3D on Unix and NT, and related software by Steven Vavasis.
site exerpt
QMG project G package does finite element mesh generation in two and three dimensions. The package includes geometric modeling software, the mesh generator itself, and a finite element solver. It is free software whose source code is downloadable from the Web. QMG2.0...J-D. Boissonnat et al.'s code for Delaunay meshing in 2 and 3 dimensions in C++.
site exerpt
Arbre de Delaunay Delaunay est une structure randomis permettant de mettre jour la triangulation de Delaunay. Cette structure permet de traiter des requtes de localisation. Quelques articles Une implantation de la version dynamique (insertion suppression) est diponible dans LEDA Une implantation plus rapide...C code for orientation and incircle tests using adaptive-precision floating-point arithmetic
site exerpt
Fast Robust Predicates for Computational Geometry Many computational geometry applications use numerical tests known as the orientation and incircle tests. The orientation test determines whether a point lies to the left of, to the right of, or on a line or plane defined by other points....Summary of major CG problems and implementations of their solutions
site exerpt
1.6 Computational Geometry This page last modified on Wed Mar 07, 2001...Two Java applets for editing polygons and point sets for input to computational geometry software.
site exerpt
JeoEdit Viewing this page requires a browser capable of displaying frames....Gmsh is a three-dimensional finite element mesh generator, primarily Delaunay, with built-in pre- and post-processing facilities. Gmsh is freely available for Windows and most UNIX platforms.
site exerpt
Gmsh: a three-dimensional finite element mesh generator with built-in pre- and post-processing facilities D finite element grid generator (primarily Delaunay) with a build-in CAD engine and post-processor. Its design goal is to provide a simple meshing tool for academic problems with parametric input and advanced visualization capabilities. Gmsh is built around four modules:...A Free Surface Reconstructor which turns unorganised point clouds to surfaces. Variety of Output Formats. (Surface Reconstruction Software)
http://www.ams.sunysb.edu/~piyush/reviver
Open-source library for manipulating 3D triangular surface meshes. Delaunay triangulations, robust geometric predicates, robust boolean set operations on surfaces, surface refinement and coarsening, level-of-detail, k-d trees, volume and curvature, strips generation.
site exerpt
GTS The GNU Triangulated Surface Library Installation instructions Bibliography Help needed Bug tracking Contribution instructions Links Projects using GTS GTS is hosted by Welcome! GTS stands for the GNU Triangulated Surface Library. It is an Open Source Free Software Library intended to provide a set of...Source code, explanations, file formats, and examples of the Edgebreaker compression and decompression techniques.
site exerpt
Rossignac's Edgebreaker 3D Compression for Triangle Meshes In response to requests from the Industry and Academia for the source code for the Edgebreaker 3D Compression and Decompression software for triangle meshes, we have decided to make a sample implementation publicly available on the web for general use....A program for exploring topological knots and knot-like objects in a 3-D rendered environment offering stills, animated knots (including dynamic forces) and demos. Aimed at mathematician and artist alike.
site exerpt
The KnotPlot Site Here you will find a collection of knots and links, viewed from a (mostly) mathematical perspective. Nearly all of the images here were created with KnotPlot, a fairly elaborate program to visualize and manipulate mathematical knots in three and four...Free interactive program for modelling liquid surfaces shaped by various forces and constraints, e.g., minimal surfaces (bubbles). Applies gradient descent to minimize energy. Available for most platforms.
site exerpt
The Surface Evolver Evolver is an interactive program for the modelling of liquid surfaces shaped by various forces and constraints. The program is available free of charge. Download the Surface Evolver for various systems. Browse Surface Evolver documentation. Surface Evolver examples: General examples....Jonathan Richard Shewchuk's Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.
site exerpt
Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator University as part of the Quake project (tools for large-scale earthquake simulation Supported by an NSERC 1967 Science and Engineering Scholarship and NSF Grant CMS-9318163. Triangle generates exact Delaunay triangulations, constrained Delaunay triangulations, conforming Delaunay triangulations, Voronoi diagrams, and high-quality...Professional C++ mesh generators. Includes product information and news releases.
site exerpt
Computing Objects CM2 MeshTools: a professional C library for mesh generation. Tools is not designed for end-users, but for software developing companies in the field of scientific computations, or research centers for their own modeling applications. Features Professional toolkit CM2 MeshTools emphasizes on efficiency (CM2 TetraMesh's speed is usually over 10000...Fast and robust C++ code available under GNU license. Handles arbitrary dimensions, and has high numerical stability.
site exerpt
Bernd Gärtner Smallest Enclosing Ball Code C software for smallest enclosing balls of balls is available here Since 1991, I maintain code for computing the smallest enclosing ball of a set of points in d-dimensional Euclidean space. However, only now has the code reached a level...A tool for the algorithmic treatment of polytopes and polyhedra.
http://www.math.tu-berlin.de/polymake/
Lot of categories and links.
site exerpt
Directory of Computational Geometry Software This page contains a list of computational geometry programs and packages. If you have, or know of, any others, please send me mail. I'm also interested in tools, like arithmetic or linear algebra packages. I have made no attempt to...A simple C++ R-tree implementation with Segment Incidences Detector as an application.
site exerpt
Mg R-tree Library The simplicity implies following restrictions: 2-dimensionality, in-memory storage, no R-star-tree functionality, coordinates approximated with 4-byte integers. The library is distributed with source code as free software under the GNU Lesser General Public License. The library has been compiled in MS...Computes convex hulls, Delaunay triangulations, Voronoi diagrams, half-space intersections about a point, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions.
site exerpt
Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection about a Point Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the...Links to Surface Reconstruction software, papers, people.
site exerpt
Reviver Home Page Please feel free to suggest sites you would like to see in any of the above pages....FastGEO, A computational geometry library written in the object pascal language.
site exerpt
FastGEO By Arash Partow O is a library that contains a wide range of highly optimized computational geometry algorithms and routines for many different types of geometrical operations such as geometrical primitives and predicates, hull construction, triangulation, clipping, rotations and projections. FastGEO offers a...Frequently Asked Questions in Polyhedral Computation.
site exerpt
Frequently Asked Questions in Polyhedral Computation http www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html What are the faces of a convex polytope/polyhedron? What is the face lattice of a convex polytope What is a dual of a convex polytope? What is simplex? What is cube/hypercube/cross polytope? What is simple/simplicial polytope? What is 0-1 polytope?...