81. Graphics & Geometry Group Conducts research in realtime 3D model aquisition, shape-based retrieval and analysis, video mosaics, Category computers computer Science computer Graphics......Princeton CS Dept Graphics Search CS websitePeople, Projects, Publications. Classes, Links, Lunch. http://www.cs.princeton.edu/gfx/

Princeton CS Dept Graphics: Search CS website:

82. Graphics & Geometry Group -- Classes Spring 2003. COS 325 Transforming Reality by computer. COS 426 - computer Graphics.COS 451 - Computational geometry. COS 496 - computer Vision. Fall 2002. http://www.cs.princeton.edu/gfx/classes.html

Princeton CS Dept Spring 2003 COS 325 - Transforming Reality by Computer COS 426 - Computer Graphics COS 451 - Computational Geometry COS 496 - Computer Vision Fall 2002 COS 436 - Human-Computer Interface Technology COS 526 - Advanced Computer Graphics COS 597b - 3D Photography Spring 2002 COS 451 - Computational Geometry COS 496 - Computer Vision COS 598d - Animation Fall 2001 COS 426 - Computer Graphics COS 436 - Human-Computer Interface Technology COS 597d - Sensing for Graphics Spring 2001 COS 451 - Computational Geometry COS 598b - Computer Graphics Rendering Techniques Fall 2000 COS 426 - Computer Graphics COS 436 - Human-Computer Interface Technology COS 597b Non Photorealistic Rendering Spring 2000 COS 598b - Geometric Modeling for Computer Graphics Fall 1999 COS 426 - Computer Graphics COS 436 - Human-Computer Interface Technology Spring 1999 COS 451 - Computational Geometry COS 598a - Animation COS 598c - Immersive Computer Systems (Part II) Fall 1998 COS 426 - Computer Graphics COS 436 - Human-Computer Interface Technology COS 597c - Immersive Computer Systems (Part I) Spring 1998 COS 451 - Computational Geometry COS 598d - Geometric Modeling for Computer Graphics Fall 1997 COS 426 - Computer Graphics COS 436 - Human-Computer Interface Technology Spring 1997 COS 451 - Computational Geometry COS 598d - Wavelets for Computer Graphics Fall 1996 COS 426 - Computer Graphics Spring 1996 COS ST2 - Advanced Topics in Computer Graphics Fall 1995 COS 426 - Computer Graphics

83. Computer Graphics Links a repository of information on the use of implicit surfaces in computer graphicsat Washington State University. Code Computational geometry code (including http://www.dgp.toronto.edu/~richard/graphics.html

Home Education Research Publications ... Personal C OMPUTER GRAPHICS Those little flickery squares are trees! Honest! General Animation Geometry Graphics Libraries ... Art General Links Computer Graphics Labs Papers Computer Graphics Publications Links Computer Graphics Bookmarks Links Computer Graphics , by Mike Krus. Links Computer Graphics on the Net , by Thorsten Kohnhorst, Robert Garmann at Uni-Dortmund. Links Computer Graphics Notes , by Steve Hollasch. Links People in Computer Graphics on Internet , by Tom Bech. SIG SIGGRAPH , the ACM Special Interest Group on Computer Graphics. SIG Eurographics (EG) , the European Association for Computer Graphics. FAQ comp.graphics.algorithms Frequently Asked Questions Notes CS488/688 - Introduction to Computer Graphics at the University of Waterloo. Notes CS563 - Advanced Topics in Computer Graphics at WPI. Notes Computer Graphics: from Pixels to Scenes by Matt Ward at WPI. Notes CS 448 - Mathematical Methods for Computer Graphics at Stanford. Notes On-Line Computer Graphics Notes , by Ken Joy. Books Graphics Gems I-V , Glassner, Arvo, Kirk, Heckbert, Paeth, eds. Academic Press, 1990-1995.

84. Geometry And Computer Informal geometry on the computer with SuperPaint Randall Michaelis Ph HomepageWhy the computer for informal geometry? Teaching informal http://www.whitworth.edu/Academic/Department/Education/Classes/ED421_Michaelis/g

Informal Geometry on the Computer with SuperPaint Randall Michaelis Ph.D. Whitworth College School of Education [ED 421 Homepage] Whitworth College Homepage] [Michaelis Homepage] Why the computer for informal geometry? Teaching informal geometry works well on the computer because: (1) Exploration is encouraged because objects and lines can easily be changed; (2) The explorations or products of the students can be easily displayed either on screen or on paper; (3) These print-outs or screen displays may easily become part of a porfolio, journal, or other forms of assessment. This kind of documentation is much more difficult to record with manipulatives. Usually one can't the geoboard all set up with rubber bands for any length of time! Is the computer a sound tool for thinking? Manipualtives are simply tools for children to think with; the computer provides a different set of tools, but can benefit even young children as a way of seeing how objects relate spatially. The children will be able to keep copies of their explorations and compare earlier work with later work. This is not easy in a manipulatives-only environment. We truly don't "know" something unless it becomes part of our language system. The computer may actually facilitate the use of language in geometry. With manipulatives the student might simply reach over and rotate an object to make it fit with another piece; in the computer environment the student must decide on such commands as Rotate Left or Flip Horizonal, and thereby learn important geometric language concepts in an embedded context.

85. Croatian Society For Constructive Geometry And Computer Graphics The admission of new members Experts in geometry, computer graphics and graphiccommunication of appropriate profiles, architects, designers, geodesists http://www.hdgg.hr/eng/application.php

About us The objectives Social activities Application form ... WEB MAIL Application form Do you also want to become member of the Society? Would you like to join some of the activities of the Society? Just fill out the application form of HDKGIKG. The admission of new members Experts in geometry, computer graphics and graphic communication of appropriate profiles, architects, designers, geodesists, engineers, civil engineers, high school teachers teaching Descriptive geometry and everyone who has interest in geometry are welcome. Article 6. of the Statute: Members of the association are: - valid members - supporting members - members of honor Any citizen of Republic of Croatia can become a valid member of the society under the terms that they agree with the programme and Statute of HDIKIKGKG and are involved directly or indirectly into geometry or computer graphics and who sign the application form and get listed in the book of members after meeting the standards of the admission test and being approved by the Management Board. Members of the society pay a membership fee established by the Management Board of the association.

86. Saurabh Sethia Applied computational geometry, computer aided manufacturing (CAM), data structuresand algorithms, computer graphics, geographic information systems (GIS http://cs.oregonstate.edu/~saurabh/

Saurabh Sethia Assistant Professor Department of Computer Science Oregon State University Corvallis, OR 97331-3202, USA. Email: saurabh "at" cs.orst.edu Phone: Fax: Snail Mail: Department of Computer Science, Oregon State University, 102 Dearborn Hall, Corvallis, OR 97331-3202, USA. Office Location: 308 Dearborn Hall Last update: Sunday August 25, 2002. Research Interests Applied computational geometry, computer aided manufacturing (CAM), data structures and algorithms, computer graphics, geographic information systems (GIS), robustness in geometric software. Teaching Winter 2003: CS262: Programming Projects in C++ Winter 2003: CS523: Analysis of algorithms Other hats I organise Algorithms reading group Donut hour Short Biography Saurabh Sethia is an assistant professor of Computer Science at Oregon State University. He received a B.E. in Electronics from RKN Engineering College, Nagpur in 1994, an M.E. in Computer Science and Engineering from the Indian Institute of Science , Bangalore in 1996 and a Ph.D. in Computer Science from the State University of New York at Stony Brook in 2001. He primarily works in Applied Computational Geometry. His other research interests include Data Structures and Algorithms, Computational Geometry for Computer Aided Manufacturing (CAM) and Computer Graphics.

87. Projective Geometry Applied To Computer Vision next up previous Next Image formation Up An Introduction to Projective PreviousIntersections and unions of Projective geometry Applied to computer Vision. http://vision.stanford.edu/~birch/projective/node18.html

HTTP 200 Document follows Date: Tue, 18 Mar 2003 10:07:18 GMT Server: NCSA/1.5.2 Last-modified: Fri, 06 Aug 1999 04:24:11 GMT Content-type: text/html Content-length: 4555 Next: Image formation Up: An Introduction to Projective Previous: Intersections and unions of Projective Geometry Applied to Computer Vision The following three sections contain the image formation equations, detailed derivations of the Essential and Fundamental matrices, and an interesting discussion of the interpretation of vanishing points. Image formation Essential and fundamental matrices Alternate derivation: algebraic Alternate derivation: from the epipolar line ... Vanishing points Next: Image formation Up: An Introduction to Projective Previous: Intersections and unions of Stanley Birchfield

88. Multiple View Geometry In Computer Vision (comp290-89) Textbook This course will heavily rely on the book Multiple View geometry in ComputerVision by Richard Hartley and Andrew Zisserman (will be available at http://www.cs.unc.edu/~marc/mvg/

Multiple View Geometry in Computer Vision Instructor: Marc Pollefeys comp290-89 Spring 2003 Tuesdays and Thursdays from 11:00-12:15 in SN011 A basic problem in computer vision is to reconstruct a real world scene given several images of it. The goal of this course is to provide students with both a good theoretical and intuitive understanding of the intricate relations between multiple views of a scene, and to allow them to use these concepts to compute properties of scene and camera from real world images. Course Objectives To understand the geometric relations between multiple views of scenes. To understand the general principles of parameter estimation. To be able to compute scene and camera properties from real world images using state-of-the-art algorithms. Target audience The target audience of this course are graduate students that are doing research in computer vision, computer graphics or image processing and/or are interested in understanding the geometry of multiple views or the possibility to compute geometric scene properties from images. Note that this course will probably only be organized every two years. Textbook This course will heavily rely on the book Multiple View Geometry in Computer Vision by Richard Hartley and Andrew Zisserman (will be available at Student Stores). This book has only recently been published, but has become a classic that can be found on the desk of many researcher in computer vision and related areas. It covers the recent theoretical advances made in the field of scene reconstruction from images, as well as practical approaches needed to compute geometric properties from real world images.

89. LCE Report 2000: Multiple View Geometry In Computer Vision Internet Services Modelling Multiple View geometry in computer Vision.Researchers Sami Brandt and Jukka Heikkonen. Viewing geometry http://www.lce.hut.fi/publications/annual2000/node16.html

Next: Computer Vision for Electron Up: Computational Information Technology Previous: Internet Services Modelling Multiple View Geometry in Computer Vision Researchers: Sami Brandt and Jukka Heikkonen Viewing geometry imposes constraints in images taken from an arbitrary object or scene. The underlying geometrical constraints can be represented by multiple view tensors called fundamental matrix, trifocal and quadrifocal tensor. In short, these tensors consists of all the projective information in the presence of two, three and four images, that is, the camera projection matrices can be reconstructed up to an projective transformation. Moreover, they can be directly used in computing projective reconstruction of given correspondences in images. We have studied the robust estimation of the fundamental matrix. In fact our research has resulted in some sense, theoretically optimal method for the fundamental matrix estimation as far as the camera model can be considered affine. In practice, the fundamental matrix contains the minimal information in order to construct the epipolar geometry between two images. In other words, as far as the fundamental matrix or the epipolar geometry is known between two images and one shows one point in the one image, one can immediately show the corresponding line where the corresponding point lies in the other image (Figure In future, we are going to extend the present work to other image geometry estimation problems such as plane homography estimation and develop methods for problems where data are fatally contaminated by outliers. We are also researching image matching and tracking using point matches where the geometrical aspects are fully utilized.

90. Projective Geometry For Computer Vision next Next The main problems in Projective geometry for computer Vision.Subhashis Banerjee Dept. computer Science and Engineering http://www.cse.iitd.ernet.in/~suban/vision/geometry/

Next: The main problems in Projective Geometry for Computer Vision Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in The main problems in computer vision An infinitely strange perspective The pin-hole camera model Standard perspective projection ... Canonical injection of into and Points at infinity Lines and conics in Planes and lines in Lines is : Pl cker coordinates Projective basis Collineations Preserves straight lines and cross ratios Illustration of perspectivity ... About this document ... Subhashis Banerjee 2002-01-12

91. Geometry Meets The Computer geometry meets the computer. Schumann, H. Green, D. 1994, Discovering geometrywith a computer using Cabri Géomètre , London, Chartwell-Bratt. http://wwwstaff.murdoch.edu.au/~kissane/geom/CabriPaper.htm

Geometry meets the computer Barry Kissane School of Education Murdoch University Introduction In a rather short space of time, computers have changed in character from being large numerical devices that could only be communicated with obliquely to small visual devices that allow for much more direct forms of person-machine communication. We have gone from the roomfull to the pocketfull, from paper tape and punched cards to keyboards, mice and touch screens and from strings of binary digits to visual images. All of this has taken not much more than one (human) generation. The IBM Corporation confidently predicted in 1945 that there would never be a market for more than two or three computers in the world , and yet in affluent countries like Australia, there are already many households with more computers than that, depending a bit on how one defines 'computer'. Such dramatic technological changes have many consequences, and one of them is the possibility that computers may be of value to children studying geometry with some access to technology. The main purpose of this paper is to describe one development of this kind, the so-called 'dynamic geometry' software that has recently begun to appear in educational settings. The first early experiments in this field involved the Geometric Supposer series of software, which allowed secondary school students to explore geometric situations efficiently. However, recent refinements of this idea are much more powerful, and include

92. PARAGRAPH --- Parallel Computer Graphics And Geometry PARAGRAPH Parallel computer Graphics and geometry. Duration April1993 March 1995. Director Bruno Buchberger. Sponsor Austrian http://www.risc.uni-linz.ac.at/projects/basic/paragraph/

PARAGRAPH Parallel Computer Graphics and Geometry Duration April 1993 - March 1995. Director Bruno Buchberger. Sponsor Austrian Ministery for Science and Research. Goals The overall goal of this project is the development of algorithms in computer graphics including geometric modeling, computational geometry and applications to robot programming. The project is in coopertation with other ACPC partners. RISC is concentrating on developing parallel algorithms within computational geometry. Convex hulls, Voronoi diagrams, closest point and point location problems, hidden line and surface removal, and shortest path problems. The algorithms that shall be developed will as in first implementation be implemented on a shared memory machine (sequent symmetry), compared with existing sequential algorithms and also compared with existing parallel algorithms. Maintained by: The System Administration Last Modification: March 7, 1997 Up RISC-Linz University Search

93. McGill - INRIA Workshop On Computational Geometry In Computer Graphics McGill INRIA Workshop on Computational geometry in computer Graphics.Bellairs Research Institute of McGill University February 9 - 15, 2002. http://www.loria.fr/~everett/McGill-ISA/Bellairs-2002/report.html

McGill - INRIA Workshop on Computational Geometry in Computer Graphics Bellairs Research Institute of McGill University February 9 - 15, 2002 List of Participants Vida Dujmovic, McGill University Hazel Everett, LORIA Marc Glisse, Polytechnic University, New York Xavier Goaoc, LORIA Sylvain Lazard, LORIA Hyeon-Suk Na, LORIA Sue Whitesides, McGill University David Wood, Carleton University, Ottawa Emails alt@inf.fu-berlin.de, hbr@poly.edu, vida@cs.mcgill.ca, everett@loria.fr, marc.glisse@ens.fr, goaoc@loria.fr, lazard@loria.fr, na@loria.fr, sue@cs.mcgill.ca, davidw@scs.carleton.ca Introduction The problems examined at the workshop concerned 3D visibility questions, with a focus on analyzing the average cost of computations rather than the usual worst-case cost. Two families of problems were studied, one having to do with lines tangent to four objects in R , the other with minimizing the expected cost of ray shooting. Visibility queries account for more than half of the overall computation time routinely spent by global illumination algorithms. One approach to speeding up rendering is to store global visibility information in a data structure, the visibility complex of Pocchiola and Vegter, for example, that can then be efficiently queried. The study of lines tangent to four objects is essential for the design and implementation of such data structures. An alternative data structure, one which is widely used for answering geometric queries such as ray shooting, is the octree. It is not known how to construct an octree for the purpose of minimizing the average cost of ray shooting. Indeed to design an optimal octree a cost measure is needed. Recently Aronov, Bronnimann, Chang and Chiang proposed a simple and promising cost measure (based on preliminary work by Aronov and Fortune). The workshop examined the problem of constructing an optimal octree with respect to this cost measure.

94. HUJI Computer Vision Research - Geometry Of Views. Conf. computer Vision, Boston, June 1995. A. Shashua and S. Avidan. The Rank4Constraint In Multiple View geometry. To appear in ECCV, April 1996. http://www.vision.huji.ac.il/research/geometry.html

Geometry of Views Consider the 3-dimensional world projected through some point in space (the camera) onto some 2-dimensional plane in space (the image). This is the basic pin-hole camera model most of our work assumes. This model allows us to formalize computer vision using a geometric and algebraic language. In this language we prove fundamental constraints and invariants between images and objects that can be used to develop algorithms for wide array of tasks. Most of the work we do is for the uncalibrated case. Plane + Parallax ego-motion and detection of moving objects. Algorithms based on this method are robust and allow multiple moving objects and occlusions. Selected Papers Michal Irani, Benny Rousso, Shmuel Peleg Robust Recovery of Ego-Motion CAIP 1993, Budapest, 13-15 Sept 1993. Michal Irani, Benny Rousso, Shmuel Peleg Computing Occluding and Transparent Motions IJCV, Vol 12 No. 1, January 1994 A. Shashua and N. Navab. Relative Affine Structure: Canonical Model for 3D from 2D Geometry and Applications PAMI Vol. 18(9), 1996. Trilinear Tensor represent scenes that avoid 3D.

95. A Computer-Communications Forum For Geometry A computerCommunications Forum for geometry. Principal Investigators. Home Page(Here is the project's home page.) computer-Communications Forum for geometry http://www.ehr.nsf.gov/EHR/RED/AAT/Award9155710.html

A Computer-Communications Forum for Geometry Principal Investigators Eugene A. Klotz Award History Award Number: 9155710 Study Duration: 6/15/92 to 6/15/95 Award: Discipline: (What areas in the curriculum does the project address?) Geometry Mathematics Education Target Population: (What kinds of learners does the project focus on now?) All interested in geometry and its teaching Home Page: (Here is the project's home page.) Computer-Communications Forum for Geometry Project Summary The purpose of the Geometry Forum is to contribute both to new telecommunications technology and to education. Through it, we plan to expand the possibilities for student learning via telecommunications, and also increase the geometry resources available to teachersincluding personal resources such as support groups. Our Forum should also make it possible for the geometry research community to become meaningfully involved with the education of school students. The Geometry Forum consists of the following three elements: An electronic database containing a great deal of useful information on geometry in all its aspectsits teaching, modern research questions, information on mathematics education projects, and records of participants interactions and questions.

96. Computational Geometry And Computer Graphics Computational geometry and computer graphics. David P. Dobkin Proc. IEEE 8014001411,1992 http//www.cs.princeton.edu/~dpd/Papers/DobkinIEEE.ps.Z. http://fano.ics.uci.edu/cites/Document/Computational-geometry-and-computer-graph

Computational geometry and computer graphics David P. Dobkin Proc. IEEE http://www.cs.princeton.edu/~dpd/Papers/DobkinIEEE.ps.Z Cites: Visibility with a moving point of view Provably good mesh generation Polynomial-size non-obtuse triangulation of polygons D. Eppstein publications ... Fano Experimental Web Server, D. Eppstein

97. CVonline: Vision Geometry And Mathematics View Consistency Constraint. MultiView geometry Homography Tensor; Transfer and Probabilityand Statistics for computer Vision Autoregression; Basic Statistics http://www.dai.ed.ac.uk/CVonline/geom.htm

CVonline: Vision Geometry and Mathematics Basic Representations Coordinate Systems Cartesian: Affine, Rectangular Cylindrical Hexagonal Log-Polar Polar Spherical Digital Topology Dual Space Homogeneous Coordinates Pose/Rotation/Orientation Representations Axis-angle Euler Angles Quaternion/Dual-Quaternion Rotation Matrix (See also Homogeneous Coordinates Rotation/Slant/Tilt Dataset Analysis and Transformation Principal Component and Related Transformations (See Principal Component Analysis Distance Metrics Affine Bhattacharyya Earth Mover's Euclidean Hausdorff ... Manhatten or city-block Elementary Mathematics for Vision Coordinate Systems, Vectors, Matrices, Derivatives and Gradients, Probability Derivatives in sampled images Function Optimization 1D Function Optimization and Golden Section ... Downhill Simplex Genetic Algorithms (See Genetic Algorithms/Programming Graduated Non-Convexity and Multi-Resolution Methods Simulated Annealing Optimization With Derivatives ... Variational Methods Geometric Shapes (See Geometric Representation of Model Features Linear Algebra for Computer Vision Eigenfunctions Eigenvalues/Eigenvectors Principal Component and Related Approaches Fisher Linear Discriminant Transformation Independent Component Analysis Kernel Linear Discriminant Analysis Kernel Principal Component Analysis ... Absolute Conic Absolute Quadric

98. Reading List For CMP Students Interested In Geometry Of Computer Vision Reading list for CMP students interested in geometry of computer Vision. SPIE, 1993.9 R. Hartley and A. Zisserman. Multiple View geometry in computer Vision. http://cmp.felk.cvut.cz/~pajdla/cmp/phd/phd-reading-list/

Reading list for CMP students interested in geometry of Computer Vision pajdla@cmp.felk.cvut.cz The reading list suggests the literature that helps us to do good and interesting research. The reading covers relevant philosophy of science, mathematics, and computer vision. I recommend to read the literature in the displayed order. I assume that the students have read the material http://cmp.felk.cvut.cz/ pajdla/cmp/phd/phd-intro/ and the literature referenced there. A very interesting work [ ] by T.S.Kuhn suggests how science develops and why it may be difficult to understand other scientists. It represents the main stream in contemporary philosophy of science. The book [ ] by H.B.Michaelson teaches how to write and present research material. An interesting definition of geometry and its role in mathematics, as well as the definition of mathematics itself, can be found in this concise and remarkably clear chapter [ ] by F.Buekenhout. The basic principles for most mathematics is here [ ]. In my opinion, this is the best book for a non-mathematician to acquire solid understanding of the concepts such as

99. DCS Graphics: NEW CLASS: CS 497 -- GEOMETRY AND COMPUTER VISION Discussion Forums NEW CLASS CS 497 geometry AND computer VISION. Admin. No Messagesin NEW CLASS CS 497 geometry AND computer VISION. Start a New Thread http://graphics.cs.uiuc.edu/forum/forum.php?forum_id=86

100. Fredo's Computer Graphics Bookmarks Interface Animation Computational geometry. other lists publications labs people . computer Vision, Image Processing, Robotics. http://graphics.lcs.mit.edu/~fredo/book.html

Page 5     81-100 of 109    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20