Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Computaional Geometry
e99.com Bookstore
  
Images 
Newsgroups
Page 3     41-60 of 84    Back | 1  | 2  | 3  | 4  | 5  | Next 20

         Computaional Geometry:     more detail

41. Computational Geometry
Proceedings of the 19th ACM Symposium on Computational Geometry, June 810, 2003 , San Diego, CA, USA. ACM 2003, ISBN 1-58113-663-3
http://www.informatik.uni-trier.de/~ley/db/conf/compgeom/index.html
Symposium on Computational Geometry
26. Symposium on Computational Geometry 2010: Snowbird, Utah, USA
Jack Snoeyink Mark de Berg Joseph S. B. Mitchell Monique Teillaud (Eds.): Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010. ACM 2010, ISBN 978-1-4503-0016-2
Contents
25. Symposium on Computational Geometry 2009: Aarhus, Denmark
John Hershberger Efi Fogel (Eds.): Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009. ACM 2009, ISBN 978-1-60558-501-7
Contents
24. Symposium on Computational Geometry 2008: College Park, MD, USA
Monique Teillaud (Ed.): Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. ACM 2008, ISBN 978-1-60558-071-5
Contents
23. Symposium on Computational Geometry 2007: Gyeongju, South Korea
Jeff Erickson (Ed.): Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007. ACM 2007, ISBN 978-1-59593-705-6
Contents
22. Symposium on Computational Geometry 2006: Sedona, Arizona, USA

42. Discrete & Computational Geometry
An international journal on discrete geometry, from both the combinatorial and computational points of view.
http://www.springer.com/mathematics/numbers/journal/454
Basket USA Change New User Login

43. Computational Geometry
CS 274 Computational Geometry. Jonathan Shewchuk Spring 2003 Tuesdays and Thursdays, 330500 pm Beginning January 21 405 Soda Hall Synopsis Constructive problems in computational
http://www.cs.berkeley.edu/~jrs/274s03/
CS 274
Computational Geometry Jonathan Shewchuk
Spring 2003
Tuesdays and Thursdays, 3:30-5:00 pm
Beginning January 21
405 Soda Hall Synopsis: Constructive problems in computational geometry: convex hulls, triangulations, Voronoi diagrams, Delaunay triangulations, arrangements of lines and hyperplanes, subdivisions. Relationships among these problems. Techniques in computational geometry: data structures, incremental construction, divide-and-conquer algorithms, randomized algorithms, backward analysis, geometric robustness. Line segment intersection, planar subdivisions, spatial search trees, visibility graphs, small-dimensional linear programming. Applications: Nearest neighbor search; triangulation for graphics, interpolation, and terrain modeling; database queries, point locations queries, and windowing queries; collision detection; discrepancy and sampling in ray tracing; robot motion planning; cartography; art gallery theorems. Here is Homework 1 Homework 2 Homework 3 Homework 4 , and Homework 5 The best related sites:

44. Canadian Conference On Computational Geometry
Sep 15, 2010 An annual international event for the dissemination of new results in the fields of computational and combinatorial geometry; usually held
http://www.cccg.ca/
The Canadian Conference on Computational Geometry The Canadian Conference on Computational Geometry is an annual international event for the dissemination of new results in the fields of computational and combinatorial geometry. The conference is usually held in a Canadian city sometime in mid-August.
The CCCG Library
The goal of the CCCG Library project is to have proceedings from all years available on this central server. For recent years, this just means moving the electronic proceedings from one location to another. For pre-1997 conferences this means scanning the paper proceedings and putting them online. The CCCG Librarian has agreed to do the scanning, but we need help entering the bibliographic information. If you browse the starred proceedings below you will see that author and title information is missing from most of the papers. You can help correct this by submitting this information online using the "Correct" link. CCCG 2010 Proceedings
CCCG 2009 Proceedings
CCCG 2008 Proceedings
CCCG 2007 Proceedings ...
CCCG 1995 Proceedings In Progress
CCCG 1994 Proceedings
CCCG 1993 Proceedings
CCCG 1992 Proceedings
CCCG 1991 Proceedings
CCCG 1990 Proceedings
CCCG 1989 Proceedings
Upcoming Conferences
CCCG 2012 in Charlottetown, Prince Edward Island

45. Course Page -- Computational Geometry (CMSC 754)
Home Page for CMSC 754 (Computational Geometry) Instructor Samir Khuller Office AVW 3217. Office phone 4056765. Email samir@cs.umd.edu.
http://www.cs.umd.edu/~samir/754/754.html
Home Page for CMSC 754 (Computational Geometry)
Instructor: Samir Khuller Office: AVW 3217. Office phone: 4056765. E-mail: samir@cs.umd.edu. Office Hours: Tuesday 2:003:00, and Friday 11:0012:00. If you cannot make these hours, please make an appointment to see me at a different time. OFFICE HOURS THIS WEEK: Wed: 1011 Thu: 35 Fri: 1112 and 3:30 4:30 Teaching Assistant: Michael Murphy Office: AVW 3228. Office phone: 4052717. E-mail: murphy@cs.umd.edu. Office Hours: Tuesday 10:0011:30, and Thursday 4:305:30. If you cannot make these hours, please make an appointment to see Michael at a different time. I hope to maintain this page and update it every week this semester. I will place all homeworks as well as solutions to homeworks here. If you have any trouble accessing them, please let me know. Class Time: Monday and Wednesday 11.0012.15, Room: CLB 0109. Course Overview: Introduction to algorithms and data structures for computational problems in discrete geometry (for points, lines, and polygons) primarily in 2 and 3 dimensions. Topics include triangulations and planar subdivisions, geometric search and intersection, convex hulls, Voronoi diagrams, Delaunay triangulations, line arrangements, visibility, and motion planning. Text: We will use more than one book. The first one (O'Rourke) will be the main text for the course. We will also use the second one from time to time (Preparata and Shamos). The other two books are mostly for your entertainment.

46. Computational Geometry
File Format PDF/Adobe Acrobat Quick View
http://www.robots.ox.ac.uk/~ian/Teaching/CompGeom/lec1.pdf

47. Algorithmic Solutions Software GmbH
Algorithmic Solutions Software GmbH provides software and consulting for application of efficient algorithms and data structures. Our innovative and efficient software
http://computational-geometry.com/
HOME ABOUT US LEDA NEWS ...
LEDA in Japan AlgoSol News LEDA Book:
Free Download More information on the LEDA pages and in the release notes. subscribe / unsubscribe news The Most Comprehensive C++ Library Available Worldwide! Professional Edition: ... LEDA Industry Research Edition: ... LEDA Academia Free Edition: ... LEDA Free Edition Which Edition Is Right For Me? Newsletter Subscription Enter your email adress here:
LEDA Features:
  • MS Windows, Unix, Linux platform Associative Container Types Number Types Linear / Curved Geometric Data Types Grafic User Interfaces Multi-thread safe Module Network Algorithms Module Geometric Algorithms Module Compression Module Cryptography Module String Alignment Module GUI
Release Note: LEDA 6.2.2 released January 18, 2010 IMPRESSUM WEB CONTACT Enter your search terms Submit search form Web www.algorithmic-solutions.com

48. The Geomblog
Oct 28, 2010 Ruminations on computational geometry, algorithms, .. that we can bring the machinery of algebraic geometry to bear on the problem.
http://geomblog.blogspot.com/
The Geomblog
Ruminations on computational geometry, algorithms, theoretical computer science and life
Thursday, October 28, 2010
FOCS Day 2: (much delayed)
I had to return to Salt Lake the evening of day 2, so blogging got left by the wayside. Piotr is to blame for this post :).
As usual, by day 2 (day 3 for me because of the tutorials day), my desire to attend talks far outstripped my ability to attend them, and I especially wanted to hear more about the Kumar/Kannan clustering with spectral norm paper, and the stability for clustering result of Awasthi, Blum and Sheffet. If I ever have control of setting the program for a conference, I'm going to decree that all talks start no earlier than 11am (they can go late in the evening, for all I care).
The first talk that I attended was by Alex Andoni on the new polylog approximation for the edit distance that he has with Robert Krauthgamer and Krysztof Onak. Dick Lipton actually spends a good deal of time on the problem and background in this post, and also highlights their earlier paper that gave a sub-polynomial appproximation in subquadratic time.
This compression is randomized: the algorithm subsamples small pieces of x. However, a straightforward sampling doesn't preserve the distance, so the algorithm actually starts by designing a careful hierarchical partitioning of x which induces a modified distance function (that they relate to the edit distance). Then the sampling takes place in this tree. Obviously I'm skipping many of the details that I didn't get, but Alex gave a very nice talk that laid out the hig level picture (his talks are always a model of clarity and intuition).

49. Computational Geometry In Degrafa « The Algorithmist
Aug 23, 2010 For anyone who is interested, here is a link (PDF) to the presentation on Computational Geometry in Degrafa. Lots of links to demos (with
http://algorithmist.wordpress.com/2010/08/23/computational-geometry-in-degrafa/
The Algorithmist
Recent Posts
Categories
Blogroll
Archives
Meta
Top WordPress ... Blog at WordPress.com . Theme: INove by NeoEase

50. Computational Geometry
A selection of articles related to Computational Geometry computational geometry, Computational geometry Books, Computational geometry - Combinatorial computational
http://www.experiencefestival.com/computational_geometry

51. Computational Geometry, C++ And Wykobi - CodeProject
A brief introduction in computational geometry algorithms using Wykobi and C++; Author Arash Partow; Section Algorithms Recipes; Chapter General Programming
http://www.codeproject.com/KB/recipes/Wykobi.aspx
7,432,015 members and growing! (19,886 online) Email Password Remember me? Lost password?

52. Mathematics Archives - Topics In Mathematics - Computational Geometry
The Bernstein B zier Form and Minimal Determining Sets ADD. KEYWORDS Triangulations Computational Geometry Literature Database
http://archives.math.utk.edu/topics/computationalGeom.html
Topics in Mathematics Computational Geometry

53. CCCG 2010
Aug 23, 2010 The 22nd Canadian Conference on Computational Geometry (CCCG) will be held at the University of Manitoba in Winnipeg, Manitoba,
http://www.cs.umanitoba.ca/~cccg2010/
Conference Information
Registration
Local Information
Past Conferences
Canadian Conference on Computational Geometry Winnipeg, August 9 - 11, 2010 The 22nd Canadian Conference on Computational Geometry (CCCG) will be held at the University of Manitoba in Winnipeg, Manitoba, Canada from August 9 to 11, 2010. The focus of the conference is on current topics in discrete and computational geometry, including both theoretical and applied results. CCCG has been held annually since 1989; as of 2010, CCCG will have been hosted at sixteen different Canadian universities and in nine of ten provinces. Authors are invited to submit articles describing original research in computational geometry. Accepted papers will be published in the proceedings distributed at the conference and electronically at cccg.ca . Selected papers will be invited for submission to a special journal issue of Computational Geometry: Theory and Applications . Please see the call for papers and the submission instructions for details.

54. SoCG Steering Committee
Computational Geometry Steering Committee. The Steering Commitee coordinates the annual Symposium on Computational Geometry (SoCG), e.g. by appointing its PC and Video chairs, it
http://www.computational-geometry.org/steering.html
Computational Geometry Steering Committee
The Steering Commitee coordinates the annual Symposium on Computational Geometry (SoCG), e.g. by appointing its PC and Video chairs, it conducts the business meeting at SoCG, it serves as liaisons to other organizations and conferences such as FCRC, and so on.
The Steering Committee is elected by the community for a term of three years (dates are running from summer to summer). The call for votes is sent on the compgeom-announce mailing list by the secretary of the steering committee.
Back to the Computational Geometry Pages
Webmaster

55. Computational Geometry
File Format PDF/Adobe Acrobat Quick View
http://activities.tjhsst.edu/sct/lectures/compgeo.pdf

56. List Of Books In Computational Geometry - Wikipedia, The Free Encyclopedia
This is a list of books in computational geometry. There are two major, largely nonoverlapping categories Combinatorial computational geometry, which deals with collections of
http://en.wikipedia.org/wiki/Books_in_computational_geometry
List of books in computational geometry
From Wikipedia, the free encyclopedia   (Redirected from Books in computational geometry Jump to: navigation search This is a list of books in computational geometry There are two major, largely nonoverlapping categories:
  • Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines, polygons, polytopes, etc., and algorithms of discrete/combinatorial character are used Numerical computational geometry, also known as geometric modeling and computer-aided geometric design (CAGD), which deals with modelling of shapes of real-life objects in terms of curves and surfaces with algebraic representation.
Contents

57. Mathtools.net : Java/Computational Geometry
Nov 11, 2001 Listing of Java computational geometry related links, tools, and resources.
http://www.mathtools.net/Java/Computational_geometry/index.html
Link Exchange for the Technical Computing Community Hosted by MathWorks
www.mathworks.com
Home Java
Computational geometry
Related Categories
Computational Geometry Applet This applet illustrates several pieces of code from Computational Geometry in C (Second Edition) by Joseph O'Rourke . The C code in the book has been translated as directly as possible into Java.
Submitted: Dec 16, 1999
Delaunay triangulation This algorithm maintains the Delaunay triangulation of points added incrementally.
Submitted: Dec 16, 1999
Slow Convex Hull and Fast Convex Hull (Wismath) There are many solutions to the convex hull problem. Here, two of them are implemented. The purpose is to compare the speed and techniques of each algorithm in finding the hull.
Submitted: Dec 14, 1999
A visual implementation of Fortune's Voronoi algorithm This page briefly describes what a Voronoi diagram is and provides an interactive demonstration of how these can be created using Fortune's plain-sweep algorithm.
Submitted: Jun 02, 2001

58. Computational Geometry Algorithms Library
File Format PDF/Adobe Acrobat Quick View
http://parasol.tamu.edu/~amato/Courses/620/cgal/cgal-tutorial.pdf

59. Computational Geometry
Messages. 2/12 2007 Information about the exam. 28/11 Project 3 new deadline Thursday January 11, 2007. 14/11 The exam will be January 15-16, 2007, and the final project is due
http://www.daimi.au.dk/~gerth/cg06/
Computational Geometry (Fall 2006)
Messages
Aims
The goal of the course is to introduce the student to fundamental problems within computation geometry, and to make the student familiar with general techniques for solving problems within computational geometry. Furthermore, through project work the student will gain experience with the implementation issues involved in converting computation geometry algorithms into running programs.
Contents
This course provides an introduction to the key concepts, problems, techniques and data structures within computational geometry, including: Concepts (points, lines, planes, spheres, duality, subdivisions, degeneracies), problems (line intersections, convex hull, Voronoi diagram, triangulations, Delaunay triangulation, overlay of subdivisions, range searching), techniques (sweep-line, randomized incremental construction, fractional cascading), and data structures (double-linked edge-lists, interval trees, segment trees, and priority search trees, Kd-trees, range trees).

60. Fast Robust Predicates For Computational Geometry
May 18, 1996 C code for orientation and incircle tests using adaptiveprecision floating- point arithmetic.
http://www.cs.cmu.edu/~quake/robust.html
Adaptive Precision Floating-Point Arithmetic and Fast Robust Predicates for Computational Geometry
Jonathan Richard Shewchuk
Computer Science Division
University of California at Berkeley
Berkeley, California 94720-1776
Created as part of the Archimedes project (tools for parallel finite element methods).
Supported in part by NSF Grant CMS-9318163 and an NSERC 1967 Scholarship. Many computational geometry applications use numerical tests known as the orientation and incircle tests. The orientation test determines whether a point lies to the left of, to the right of, or on a line or plane defined by other points. The incircle test determines whether a point lies inside, outside, or on a circle defined by other points. Each of these tests is performed by evaluating the sign of a determinant (see the figure below). The determinant is expressed in terms of the coordinates of the points. If these coordinates are expressed as single or double precision floating-point numbers, roundoff error may lead to an incorrect result when the true determinant is near zero. In turn, this misinformation can lead an application to fail or produce incorrect results. One way to solve this problem is to use exact arithmetic. Unfortunately, traditional libraries for arbitrary precision floating-point arithmetic are quite slow, and can reduce the speed of an application by one or two orders of magnitude.

Page 3     41-60 of 84    Back | 1  | 2  | 3  | 4  | 5  | Next 20

free hit counter