标题: 计算几何与计算机图形学方面的一些资源及源代码收藏(英文版) [打印本页] 作者: zhouningyi1 时间: 2012-3-9 22:47 标题: 计算几何与计算机图形学方面的一些资源及源代码收藏(英文版) 资料都非常好， 很多问题自己觉得花了很多力气，其实却是国外很久以前的热点了。计算几何是参数化的算法基础，很基础很重要，在这方面我们和国外的差距是非常大的，有兴趣的同学可以关注一下。
在鄙人小站数学的美学世界小站也发了一稿，另外也有些别的数字资源，欢迎关注
http://zhan.renren.com/mathart
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 that can be run interactively over the web
are listed on separate web pages.Caveat Surfor ! I can't make any claims about the usefulness or quality of the programs listed here. I don't have the time or equipment to try them all. If you have experience with any of these programs, either positive or negative, please tell me about it .
The programs on this page are divided into several categories, some of which are divided into further sub-categories. (Eventually, each category will get its own separate web page.) Each program is listed only once, but I've provided cross-links between overlapping categories, and I've tried to arrange similar categories near each other.
Each category also includes links to relevant pages in Nina Amenta 's comprehensive Directory of Computational Geometry Software , which I strongly encourage you to visit!
Items marked have been recently added or modified.
Robust low-level primitivesAvoid roundoff and precision errors! Use this code instead of naïve floating point or integer arithmetic.
Convex hulls and convex polyhedraMost convex hull programs will also compute Voronoi diagrams and Delaunay triangulations. (Actually, all of them do, if you look at them the right way.)
Relevant pages from DCGS:
Harald Rosenberger's implementation of the beneath-beyond method for 3- and 4-dimensional convex hulls, courtesy of Ernst Mücke's GeomDir .
Arbitrary-dimensional convex hulls
lrs 3.1 : the first "official" distribution of David Avis' implementation of Avis and Fukuda's reverse search algorithm for vertex/facet enumeration. (This is an updated version of an earlier preliminary implementation .) An extensive user's guide is included.
Qhull by Brad Barber, David Dobkin, and Hannu Huhdanpaa
Hull: Arbitrary-dimensional convex hulls, Voronoi diagrams, Delaunay triangulations, and alpha shapes, by Ken Clarkson
PORTA , a collection of tools for analyzing polytopes and polyhedra, by Thomas Christof and Andreas Loebel , featured in Günter Ziegler's Lectures on Polytopes .
Computational geometry software by Ioannis Emiris : perturbed convex hulls in arbitrary dimensions, exact convex hulls in two and three dimensions, mixed volume in arbitrary dimensions, and mixed subdivisions in the plane.
Kurt Mehlhorn's programs for generating higher dimensional convex hulls and Delaunay triangulations and checking geometric structures. (C++WEB output only)
Vinci (also here ): a program for computing volumes of convex polytopes, presented as either the convex hull of a set of points, the intersection of a set of halfspaces, or both (with the vertex-facet incidence graph). Extensive online documentation and sample polytope files are available. Written by Benno Büeler , Andreas Enge , and Komei Fukuda .
Polymake , a general-purpose polytope and polyhedron manipulation tool by Ewgenij Gawrilow and Michael Joswig Requires either cdd+ , lrs , or porta for some computations and geomview for visualization. [C++ and Perl]
PUNTOS , a Maple package for computing triangulations of polytopes, regular triangulations of point sets, and their underlying oriented matroids, by Jesús de Loera
Voronoi diagrams and Delaunay triangulations of pointsMany convex hull programs can also compute Voronoi diagrams and Delaunay triangulations.
2d and 3d Delaunay triangulations by Jean-Daniel Boissonnat, Olivier Devillers, Stefan Meiser, and Monique Teillaud, from the PRISME project at INRIA Sophia-Antipolis.
The Delaunay hieararchy , a data structure for 2d Delaunay triangulations that supports dynamic insertions (and deletions, but those aren't implemented), by Olivier Devillers, from the PRISME project at INRIA Sophia-Antipolis. (Solaris and SGI executables only)
GAMBINI: a program for constructing multiplicatively weighted Voronoi diagrams for points in the plane, by Barry Boots . (Windows 3.1/95/NT executable only)
Ernst Mücke's Detri , from his GeomDir , robustly computes 3D Delaunay triangulations.
GAMBINI: a program for constructing multiplicatively weighted Voronoi diagrams for points in the plane, by Barry Boots . (Windows 3.1/95/NT executable only)
Ernst Mücke's Detri , from his GeomDir , robustly computes 3D Delaunay triangulations.
Super Delaunay , a commercial fully dynamic constrained Delaunay triangulation package from David Kornmann (description only) . Interactive demo versions for Sun Solaris and Linux are available here (binaries and data only) . Demo versions for other architectures are available from the author .
Dani Lischinski 's incremental constrained Delaunay triangulation program CDT .
Robert J. Renka's TRIPACK , Collected Algorithms of the ACM#751, computes constrained Delaunay triangulations, convex hulls, polygon areas, nearest neighbors, and shortest paths. (FORTRAN)
Medial axes and Voronoi diagrams of line segments
Voronoi Diagrams of 2D Shapes by Martin Held . Robust computation of Voronoi diagrams and offset curves for planar shapes bounded by straight line segments and circular arcs. The web site only describes the software and illustrates some of the results; the code is available by email.
avd , a LEDA extension package to compute abstract Voronoi diagrams in the plane, by Michael Seel. Code for Euclidean Voronoi diagrams of points and line segments is included.
Miscellaneous
VoronoiImage by Marc Grundland: an image processing program that uses nested Voronoi diagrams to acheive stained-glass effects (Mac binaries only) [Warning: frames!]
VisPak: a package of visibility-related algorithms implemented by Helen Pinto and Lillanne Jackson at the University of Lethbridge. Requires LEDA to compile, but Sun binaries are provided.
DUST , a program for visualizing Voronoi diagrams, Delaunay triangulations, minimum spanning trees, and matchings in various metrics. From Michael Jünger's research group at Universität zu Köln.
Peek by Gordon Kindlmann , a program for visualizing high-dimensional polytopes through their cross-sections and projections (or as Amenta and Ziegler would have it, their shadows and slices ).
Cinderellas Café , a "dynamic geometry" Java program written by Ulrich Kortenkamp and Jürgen Richter-Gebert, dynamically maintains sets of geometric objects (points, lines, circles, and conics) as the user moves their defining points around, provides primal and polar views of the same objects, supports spherical and hyperbolic geometry, and even includes some automatic theorem proving! A demo version is available. Information is currently available in German only.
Geomview , the Geometry Center's 3d geometric visualization program, written by Stuart Levy, Tamara Munzner, Mark Phillips, and a cast of thousands. Also available from a mirror site in Berlin .
JGV , a successor to GeomView written in Java, also from the Geometry Center. (Java, source not available)
Bob Lewis 's homogeneous coordinates and duality visualization program VideHoc (SGI executable only)
MAXRAD : software to find the maximum radius sphere touching each point (atom) in a set (molecule) using inversion and convex hulls, by Todd Yeates . (FORTRAN)