These pages contain usenet clippings, web pointers, lecture notes, research excerpts, papers, abstracts, programs, problems, and other stuff related to discrete and computational geometry. Some of it is quite serious, but I hope much of it is also entertaining. The main criteria for adding something here are that it be geometrical (obviously) and that it not fit into my other geometry page, ...

A comprehensive directory of computational geometry resources ...

Dave's Short Trig Course Table of Contents Who should take this course Trigonometry for you Your background How to learn trigonometry Applications of trigonometry Astronomy and geography Engineering and physics Mathematics and its applications What is trigonometry Trigonometry as computational geometry Angle measurement and tables Angle measurement The concept of angle Radians and arc length ...

A C++ software library of geometric data structures and algorithms.

The International Journal of Computational Geometry & Applications is a bimonthly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms.

The Voronoi Web Site Frames No Frames ...

The GTS Library Introduction Getting GTS Packages Download Version 0.6.0 Debian packages Sample files Developmental CVS Instructions View CVS tree Mailing Lists Sourceforge page Screenshots GTS in action Documentation GTS Reference GLib Reference Installation instructions Bibliography Help needed Bug tracking Contribution instructions Links Projects using GTS GTS is hosted by Welcome! GTS stands ...

Frequently Asked Questions About Trigonometry Back to Dave's home page Q: What is trigonometry A: Trigonometry is the study of how the sides and angles of a triangle are related to each other. Q: WHAT That's all A: Yes, that's all. It's all about triangles, and you can't get much simpler than that. Q: You mean trigonometry isn't some big, ugly monster that makes students turn green, scream, ...

An introduction to TRIGONOMETRY Definitions and basics Trigonometric circle and angles Trigonometric numbers of a real number t Basic formulas Related values supplementary values complementary values Opposite values Anti supplementary values The right-angled triangle Area of a triangle Sine rule Homogeneous expression in a, b and c Cosine rule Trigonometric functions The sine function The cosine ...

QMG: mesh generation and related software The QMG 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 runs under Unix and Windows NT. There are now three releases of QMG: QMG1.0, released 5 May ...

The trigonometric functions Analysis index History Topics Index The use of trigonometric functions arises from the early connection between mathematics and astronomy. Early work with spherical triangles was as important as plane triangles. The first work on trigonometric functions related to chords of a circle. Given a circle of fixed radius, 60 units were often used in early calculations, then ...

Freely available implementations of geometric algorithms ...

Geometry, quadtree, global error, subdivision surfaces, digital geometry processing, geometry compression, transmission ...

Resources for computational geometry algorithm software programming including 1) monthly algorithms with C++ code and an archive AND 2) relevant books AND 3) related web sites AND 4) a short history of geometry ...

The book of nature is written in the characters of geometry. - Galileo Go to Specific Links Related to 308-507 (Computational Geometry course). General Links - Computational Geometry: Geometryalgorithms.com ( Fantastic Resource Page for Computational Geometry!) Jeff Erickson's Computational Geometry Pages Geometry in Action Geometry Publications by Author Godfried's Research Interests in ...

The Computational Geometry Impact Task Force Report, by Bernard Chazelle and others ...

Gmsh: a three-dimensional finite element mesh generator with built-in pre- and post-processing facilities Christophe Geuzaine and Jean-Francois Remacle Version 1.34, 18 February 2002 Description Gmsh is an automatic three-dimensional finite element mesh generator, primarily Delaunay, with built-in pre- and post-processing facilities. Its primal goal is to provide a simple meshing tool for ...

Everything should be made as simple as possible but not simpler. - Albert Einstein Simplicity is embarrasing when you have to work for months to achieve it. - Kary Mullis Computational Geometry: Proofs and Refutations in Geometry Mobility of Objects in Space (Robotics, Linkages, Polymer Physics and Protein Folding) Visualization Avoiding Algorithm-Induced Degeneracies Quadrangulations in Mesh ...

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 polygon also is a fundamental operation in computational geometry, and it has ...

Journals publishing papers in computational geometry and related fields ...

The Surface Evolver Version 2.14 August 18, 1999 (Version 2.17 for the adventurous.) My Surface 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. Ball Grid Array ...

Ear Cutting for Simple Polygons by Ian Garton Contents Introduction to Ear Cutting for Simple Polygons The Two-Ears Theorem An O(kn) Time Algorithm For Finding an Ear An O(n) Time Algorithm For Finding an Ear Interactive Ear Cutting! The One-Mouth Theorem Interactive Mouth Closing! Glossary of Terms References This page was last updated on Wednesday, December 10th, 1997. 1997 Ian Inc. ...

Trigonometry and Music Sounds are produced by things that vibrate. Pure tones, like the the sounds produced by tuning forks, are described by sine waves y = A sin(2 pi f t), where t is time, f is how many times the thing is vibrating per second (f is for frequency, and A is how loud the sound is (A is for amplitude). If something is vibrating 256 times a second, you hear middle c. Sound of ...

The JeoEdit package, consisting of the JeoEditPoints applet and the JeoEditPolygon applet, is a set of Java visual editors for computational geometry. Their mission is to help the computational geometry community to realize its algorithms and theorems on the internet, by providing a flexible and easy interface for drawing a set of points or a polygon as well as the means to communicate this ...

Strategic Directions in Computational Geometry Working Group Report ...

1.6 Computational Geometry Specific Algorithms 1.6.1 Robust Geometric Primitives 1.6.2 Convex Hull 1.6.3 Triangulation 1.6.4 Voronoi Diagrams 1.6.5 Nearest Neighbor Search 1.6.6 Range Search 1.6.7 Point Location 1.6.8 Intersection Detection 1.6.9 Bin Packing 1.6.10 Medial-Axis Transformation 1.6.11 Polygon Partitioning 1.6.12 Simplifying Polygons 1.6.13 Shape Similarity 1.6.14 Motion Planning 1.

Source code, explanations, file formats, and examples of the Edgebreeaker compression and decompression techniques.

Computational Geometry Authors and titles for recent submissions Thu, 25 Jul 2002 Wed, 17 Jul 2002 Tue, 16 Jul 2002 Fri, 12 Jul 2002 Thu, 11 Jul 2002 Thu, 25 Jul 2002 cs.CG/0207081 : Title: Moebius-Invariant Natural Neighbor Interpolation Authors: Marshall Bern, David Eppstein Comments: 2 pages, 1 figure Subj-class: Computational Geometry ACM-class: F.2.2 Wed, 17 Jul 2002 cs.CG/0207063 : Title: ...

CM2 MeshTools is a powerful professional C++ suite for mesh generation.

L'arbre de Delaunay. L'arbre de Delaunay est une structure randomise permettant de mettre jour la triangulation de Delaunay. Cette structure permet de traiter des requ tes de localisation. Quelques articles Une implantation de la version dynamique (insertion suppression) est diponible dans LEDA Une implantation plus rapide ne traitant que les insertions est disponible par ftp. Une implantation ...

In Proc. 1988 International Conference on Parallel Computing, vol. III, pp. 104-107. Constant-Time Geometry on PRAMs Quentin F. Stout EECS Department, University of Michigan Abstract: Given n points chosen uniformly and independently from the unit square, it is shown that a parallel random access machine (PRAM) with n processors can solve several geometric problems in constant expected time.

More information about the database The original description about history, state, and use of the database, formatted with Hyperlatex (with some later manual revisions): History and overview Bibliographers Creating entries Formatting entries Sample entries Miscellaneous comments and open problems Here is Joe O'Rourke's Computational Geometry Column on the database (in Postscript). And these are ...

Various resources associated with computational geometry, including animation, research, and technical terms.

A calculator designed in PHP which will take any 3 elements of a Triangle, and Return values for all other elements ...

Voronoi Diagrams Selected References Books Spatial Tessellations: Concepts and Applications of Voronoi Diagrams by Okabe, Boots and Sugihara, John Wiley & Sons, 1992. This is the bible. Definitions, properties, algorithms, generalizations and applications galore! Unfortunately, it retails for $180. The King County Library System has one copy. There are several copies scattered among academic ...