GeomDir This is a small collection of computational geometry software, papers, and resources. Official URL: http://www.geom.uiuc.edu/locate/cglist/GeomDir Provider: Ernst Mücke, . Contents Source code Robust 3D Delaunay triangulations (ANSI C) A Sample of 3D Data Sets (Point Coordinates) Convex Hulls in 3&4D (Pascal) Papers Fast Randomized Point Location in 2&3D Delaunay Triangulations Alpha shapes: Definitions and Software Three-dimensional Alph ...

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 fo ...

Search the Geometry Literature Database This form allows you to search the Geometry Literature Database. It is based on the biblook program by Jeff Erickson. Field ANYauthortitlekeywordsjournalbooktitleyearinstitutiontype must (must not) contain the following keywords Maximum number of matches to display: 103060100

Computational geometric and graphics codes unigrafix.java, a subset unigrafix parser written in java, by Eric Brittain (Mar 2005); fixpdfbbox, a csh shell script that takes as input a PDF file with incorrect bounding box information (for example, from a Windows application), and converts it into (i.e. generates) a new PDF file with a correct bounding box. The script also produces an EPS file with a corrected bounding box, as a side effect. Example usage: % fixpdfbbox myfile.pdf (produce ...

Document inexistant Document not found Désolé, le document que vous avez demandé n'existe pas sur ce serveur ! Sorry, the document you asked for does not exist on this server ! Pour trouver les informations recherchées, vous pouvez : aller sur la page d'accueil du site de l'INRIA Sophia-Antipolis faire une requête par Altavista : To find informations you are seeking, you can: go to INRIA Sophia-Antipolis' home page request INRIA Sophia-Antipolis' index : Aide / Help | page d'accueil du site | home page © INRIA Sophia-Antipolis - webmaster@www-sop.inria.fr

Joseph O'Rourke Olin Professor and Chair of Computer Science; Professor of Mathematics. Smith College. Northampton, MA 01063, USA (413) 585-3673; Fax (413) 585-3786 orourke@cs.smith.edu Research Summary (I thank Jeff Erickson for the figure to the left, based on one of my own (in this paper), but his is much nicer. Photo to the right by Julio Guillen.) Courses: Fall 2005Spring 2006 CSC 102: How the Internet WorksCSC 102: How the Internet Works CSC 240: Computer Graphics CSC ...

Fast Polygon Triangulation based on Seidel's Algorithm Atul Narkhede Dinesh Manocha Department of Computer Science, UNC Chapel Hill Getting the code Click here to get the C-source Introduction Computing the triangulation of a polygon is a fundamental algorithm in computational geometry. In computer graphics, polygon triangulation algorithms are widely used for tessellating curved geometries, as are described by splines [Kumar and Manocha 1994]. Methods of triangulation inclu ...

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 pilesAll the junk in one big pile New junkMy own junk New experimental RSS feed David Eppstein, Theory Group, ICS, UC Irvine. Semi-automatically filtered from a common source file.