Learning Resources for Students, Families and Teachers

Search over 100,000 research quality URLs

StudySphere provides fast, easy and free access to a wide variety of research-quality child-safe websites organized for education online from home, school, study abroad and home school. StudySphere’s goal is to help students, teachers, librarians, and other researchers find both highly targeted and closely related information quickly.

Computational Geometry

/Home/Mathematics/Geometry/Computational Geometry


		Ernst Mucke's GeomDir ^Votes:0 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, <epm@ansys.com> . 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 Alpha shapes Simulation of Simplicity References Detri_2.6.a.tar.gz Sources to the latest version of Detri. The code constructs the 3D Delaunay triangulation of a given point set using a variant of the randomized incremental-flip algorithm [J91,ES96,M93] . It achieves robustness by using the SoS symbolic perturbation method [EM90] Read More Go to Site


		CGAL - Computational Geometry Algorithms Library ^Votes:0 Home Software Online Manual All Manuals The CGAL Philosophy Download License Acknowledging CGAL Release History Support FAQ Supported Platforms Reporting Bugs Mailing Lists Project Project Members Work in Progress Getting Involved Project History Members Area Dissemination News Events Classes Other Resources Scilab Geometry Toolbox Python Bindings CGAL-Ipelets Projects Using CGAL 3rd Party Software Related Links www cgal.org The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics Read More Go to Site

		Geometry in Action ^Votes:0 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. Geometric references and techniques General geometric references Related applications pages Patents in geometric applications Constraint solving Convex hulls and intersections of halfspaces Interpolation and surface reconstruction Mesh generation Minimum Spanni Read More Go to Site

		GeomLib ^Votes:0 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 (produces myfile.pdf+ and myfile.eps+) plucker (1.5Mb), a program written between 1990 and 1992 to visualize plucker coordinates, antipenumbrae, et cetera; included in this tar file is an SGI IRIX 6.5 executable, partial source, and operating instructions. [Use tar xvf lp.tar to extract.] lp , Mike Hohmeyer's C im Read More Go to Site

		Polygon Triangulation ^Votes:0 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 include greedy algorithms [O'Rourke 1994] , convex hull differences [Tor and Middleditch 1984] and horizontal decompositions [Seidel 1991] . This Gem describes an implementation based on Seidel's algorithm ( op. cit. ) for triangulating simple polygons having no holes (The code has since then been extended to handle holes) Read More Go to Site

		The Geometry Junkyard ^Votes:0 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 New experimental RSS feed David Eppstein , Theory Group , ICS , UC Irvine . Semi-automatically filtered from a common source file. Read More Go to Site

StudySphere is an outstanding resource for homework help, special education, music school, cooking school, charter schools, art schools, technical schools, traffic school, film schools, catholic schools, etc.