Geometria Computacional na Internet

• Computational Geometry Algorithms Library

  The goal of the project is to design and implement a robust, easy to use, and efficient C++ software library of geometric algorithms. The library is developed in close collaboration with 10 companies in Europe.

  This library consists of a number of different parts:

  1. The kernel will contain the basic geometric data types and constant-time operations on them.
  2. The basic library will be a collection of implementations of a large number of standard geometric algorithms, such as convex hull and Voronoi diagram algorithms.
  3. The support libraries will interface CGAL-programs to other packages, e.g. for visualisation, and I/O.
  4. Finally, there will be application extensions in which collections of geometric routines are provided that are useful for some specific application domain, such as Geographic Information Systems, Computer Graphics, Robotics, and Computer Vision.

• Computational Geometry Pages by Jeff Erickson

  Welcome to the Computational Geometry Pages, a (hopefully) comprehensive directory of computational geometry resources both on and off the Internet. If there is something you'd like to see here, please send me email. Contributions and suggestions from the community are always welcome!

  Other essential computational geometry sites include Nina Amenta's Directory of Computational Geometry Software, Hervé Brönnimann's CG Tribune (a newsletter with events and announcements), David Eppstein's Geometry in Action (describing applications of computational geometry in the Real World), and the Los Alamos e­print archive's collection of computational geometry papers [new, recent, current, search] moderated by Joe O'Rourke.

  There are also several excellent Web pages devoted to theoretical computer science in general. See especially Suresh Venkatasubramanian's Theoretical Computer Science on the Web and the ACM SIGACT home page.

• Computational Geometry on the WEB by Godfried T. Toussaint

  "The book of nature is written in the characters of geometry." - Galileo

• The Geometry Junkyard by David Eppstein

  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, Geometry in Action, which is more devoted to applications and less to pure math. I also have another page on non-geometrical recreational math.

  Junk sorted into piles	All the junk in one big pile
  New junk	My own junk

• Center for Geometric Computing

  Centro formado por Brown University, Duke University e Johns Hopkins University.

• Geometry in Action by David Eppstein

  This page collects various areas in which ideas from discrete and computational geometry (meaning mainly low-dimensional Euclidean geometry) meet some real world applications. It contains brief descriptions of those applications and the geometric questions arising from them, as well as pointers to web pages on the applications themselves and on their geometric connections. This is largely organized by application but some major general techniques are also listed as topics. Suggestions for other applications and pointers are welcome.

• Directory of Computational Geometry Software by Nina Amenta.

  This page contains a list of computational geometry programs and packages.

• Computational Geometry Courses Material by Jeff Erickson

  This page lists course syllabi and lecture notes for university-level courses in computational geometry and closely related fields.

  Many K-12 and college geometry courses use computers as teaching tools, but that's not what I mean by "computational geometry courses". For more general geometry teaching materials, see the Swarthmore College Math Forum, or David Eppstein's page of lesson plans and teaching materials (from his Geometry Junkyard).

• The LEDA Platform of Combinatorial and Geometric Computing by K. Mehlhorn and St. Näher

  LEDA is a library of the data types and algorithms of combinatorial computing. The main features are:

  • LEDA provides a sizable collection of data types and algorithms in a form which allows them to be used by non-experts. In the current version, this collection includes most of the data types and algorithms described in the text books of the area.
  • LEDA gives a precise and readable specification for each of the data types and algorithms mentioned above. The specifications are short (typically, not more than a page), general (so as to allow several implementations), and abstract (so as to hide all details of the implementation).
  • For many efficient data structures access by position is important. In LEDA, we use an item concept to cast positions into an abstract form. We mention that most of the specifications given in the LEDA manual use this concept, i.e., the concept is adequate for the description of many data types.
  • LEDA contains efficient implementations for each of the data types, e.g., Fibonacci heaps for priority queues, red-black trees and dynamic perfect hashing for dictionaries, ...
  • LEDA contains a comfortable data type graph. It offers the standard iterations such as ``for all nodes v of a graph G do'' or ``for all neighbors w of v do'', it allows to add and delete vertices and edges, it offers arrays and matrices indexed by nodes and edges,... The data type graph allows to write programs for graph problems in a form close to the typical text book presentation.
  • LEDA is implemented by a C++ class library. It can be used with almost any C++ compiler (g++, CC, xlC, cxx, Borland, MSVC++, Watcom).
  • LEDA is not in the public domain, but can be used freely for academic research and teaching. A commercial license is also available.
  • The research version of LEDA is available via WWW
  • If you are interested in a commercial version of LEDA please contact Algorithmic Solutions GmbH

• Computational Geometry Bibliography

  This is a gateway to the computational geometry bibliography. In order to use this page your browser must be able to handle forms.

• The Voronoi Web Site by Christopher Gold

  his site is being established to encourage communication between those workers (academic or commercial, users or developers), using Voronoi or Delaunay methods of spatial analysis. We hope that the exchange of ideas in this field, between a wide variety of users, will foster the dissemination of this approach to spatial analysis.

• Geometria Computacional no DCC-USP mantida por Cassio Polpo de Campos e Eduardo Garcia de Freitas

  Página sobre Geometria Computacional contendo links para vários outros sítios e programa desenvolvidos em C bem como applets em Java

• Cassio Polpo de Campos e Eduardo Garcia de Freitas implementaram alguns algoritmos em geometria computacional que veremos durante as aulas. O Cassio fez a suas implementações em C e o Eduardo fez alguns applets em Java.