Home  - Pure_And_Applied_Math - Convex Geometry

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

81-92 of 92    Back | 1  | 2  | 3  | 4  | 5

Convex Geometry:     more books (100)

A decision procedure using the geometry of convex sets (New York) by P. W Aitchison, 1974 Tesseract: Geometry, Fourth Dimension, Cube, Square (geometry), Cell (geometry), Convex Regular 4-polytope, Hypercube, Duoprism, 16-cell, Dual Polyhedron, Hyperplane Convex Geometry Analysis (Mathematical Sciences Research Institute Publications, No. 34) by Keith (editor); Milman, Vitali (editor) Ball, 1999 Radon transforms, geometry, and wavelets; proceedings. (Contemporary mathematics by Convex Geometry, and Geometric Analysis AMS Special Session on Radon Transforms, Complex Geometry of Convex Domains That Cover Varieties: MSRI 00708-88; November 1987 by S. Frankel, 1987 A lower bound on the complexity of the convex hull problem for simple polyhedra (Technical report) by Andrew Klapper, 1987 Approximating convex hulls of finite sets of curves (Technical report) by Andrew Klapper, 1987 A lower bound on the number of unit distances between the vertices of a convex polygon (Report / UIUCDCS-R-88-) by Herbert Edelsbrunner, 1988 The maximum number of ways to stab n convex non-intersecting objects in the plane is 2n-2 (Report / UIUCDCS-R-87) by Herbert Edelsbrunner, 1987 Some random secants through a convex body (Impresiones previas) by Fernando Affentranger, 1986 The convex hull of random circles (Computer science technical report) by Fernando Affentranger, 1991 Probing convex polygons with half-p]anes (Report) by Steven A Skiena, 1987 Digital topology of sets of convex voxels (CS-TR) by Punam K Saha, 1998 Ordered incidence geometry and the geometric foundations of convexity theory (Research report) by A Ben-Tal, 1984

lists with details

81. Ioannis Z Emiris
    Computational geometry. pyramid algorithm for computing a subset of the integer points in all nfold Minkowski sums of a family of n+1 convex (Newton) polytopes  
    http://www-sop.inria.fr/saga/logiciels/emiris/logiciels.geo-eng.html

82. EE364: Convex Optimization & Applications
    Basics of convex analysis. Applications to signal processing, control, digital and analog circuit design, computational geometry, statistics, and mechanical  
    http://www.stanford.edu/class/ee364/
    
    Extractions: Introduction ( ps pdf Convex sets ( ps pdf Convex functions ( ps pdf Convex optimization problems ( ps pdf Linear and quadratic problems ( ps pdf Geometric and semidefinite programming ( ps pdf Duality ( ps pdf Smooth unconstrained minimization ( ps pdf Sequential unconstrained minimization ( ps pdf Data fitting and estimation ( ps pdf Geometrical problems ( ps pdf Filter design ( ps pdf Problems in VLSI design ( ps pdf Ellipsoid method ( ps pdf Subgradients ( ps pdf Conclusions ( ps pdf top of ee364 page The textbook is available at the Stanford Bookstore, as the Reader for EE364, and also as a pdf file, at the link www.stanford.edu/~boyd/cvxbook.html

83. > Java > Computational Geometry
    convex Hull (Wismath) There are many solutions to the convex hull problem. The geometry Applet - This geometry applet is being used to illustrate Euclid s  
    http://www.mathtools.net/Java/Computational_geometry/
    
    Extractions: Mathtools.net Java Computational geometry Add Link ... Other 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. - This applet generates Delaunay triangulation and Voronoi digram incremently. Insertion and deletion of nodes are local processes. They just update the structures involved in this step. ChanDC convex hull demo Computational Geometry - This is a project I implemented in Java for the Computational Geometry course here at Hopkins. It implements two algorithms for segments intersection: the obvious one (every two segments are cheked for intersection) -on the left- and Balaban's algorithm -on the right-. The first one has an asimptotic running time of O(n2); the second one has an asimptotic running time of O(n log2(n)+k) where n is the number of segments and k is the number of intersection points. 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.

84. Mathtools.net: The Technical Computing Portal For All Your Scientific And Engine
    and operations such as intersections and distance calculation; a collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay  
    http://www.mathtools.net/C /Computational_geometry/

85. MathGuide: Convex And Discrete Geometry
    MathGuide convex and discrete geometry (6 records). 1. Bowers, Philip L. Florida State University. Subject Class, convex and discrete geometry.  
    http://www.mathguide.de/cgi-bin/ssgfi/anzeige.pl?db=math&sc=52

86. MA312: Geometry And Convexity
    Courses in the Department of Mathematics. MA312 geometry and convexity. Content Introduction to geometry in R n . convex sets and convex functions.  
    http://www.maths.lse.ac.uk/Courses/ma312.html
    
    Extractions: There will also be revision lectures in the Summer term. Classes To be arranged. The classes will start in Week 2 of term. Class arrangements will be posted by the end of Week 1. Further details will appear here in due course. Exercises Course-material Literature Assessment There will be a formal 2-hour examination in the Summer term. Past papers will be available in the Summer term, but can also be obtained on this web-server. Course description of MA312: Geometry and Convexity Not available 2003/4 Availability: Students are expected to have followed Introduction to Abstract Mathematics (MA103) and Real Analysis (MA203). Students who have not done MA203, but feel they have sufficient mathematical background, should contact the teacher.

87. Qhull For Convex Hull, Delaunay Triangulation, Voronoi Diagram, And Halfspace In
    programming; Lambert s Java visualization of convex hull algorithms; Stony Brook Algorithm Repository, computational geometry. Qhull  
    http://www.qhull.org/
    
    Extractions: To: News Download CiteSeer Images ... Options Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. Qhull does not support constrained Delaunay triangulations, triangulation of non-convex surfaces, mesh generation of non-convex objects, or medium-sized inputs in 9-D and higher. Introduction Fukuda's introduction to convex hulls, Delaunay triangulations, Voronoi diagrams, and linear programming

88. Course Page -- Computational Geometry (CMSC 754)
    convex hulls Geometric duality, deterministic and randomized algorithms for two and higher dimensional convex hulls, linear programming.  
    http://www.cs.umd.edu/~samir/754/754.html
    
    Extractions: 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.

89. Wiley Canada::Affine Geometry Of Convex Bodies
    Wiley Canada Mathematics Statistics General Mathematics Mathematics Affine geometry of convex Bodies. Related Subjects,  
    http://www.wiley.ca/WileyCDA/WileyTitle/productCd-3527402616.html

90. Wiley::Affine Geometry Of Convex Bodies
    Wiley Mathematics Statistics General Mathematics Mathematics Affine geometry of convex Bodies. Related Subjects,  
    http://www.wiley.com/WileyCDA/WileyTitle/productCd-3527402616.html

91. Arbitrary Dimensional Convex Hull, Voronoi Diagram, Delaunay Triangulation
    Arbitrary dimensional convex hull, Voronoi diagram, Delaunay triangulation. qhull. Arbitrarydimensional convex hull. Computes approximate hulls. Floating-point arithmetic with many parameters for tolerancing. Very fast.  
    http://www.geom.umn.edu/software/cglist/ch.html
    
    Extractions: Up: Directory of Computational Geometry Software Arbitrary-dimensional convex hull. Computes approximate hulls. Floating-point arithmetic with many parameters for tolerancing. Very fast. Deterministic incremental algorithm with heuristics. Does Voronoi diagrams and Delaunay triangulations and, in low dimensions, Geomview output. Check out the qhull home page for more information. By Brad Barber, David Dobkin and Hannu Huhdanpaa, The Geometry Center. To get the code, go to our qhull download page Arbitrary-dimensional convex hull. Computes exact hull of infinitesimally perturbed input. The symbolic perturbations handle all degenerate cases and break output faces up into simplices. Deterministic incremental algorithm. Does Voronoi diagrams and Delaunay triangulations and, in low dimensions, Geomview output. The options are described in the README file for chD. By Ioannis Emiris, U.C. Berkeley. The code, and the relevant papers, are available by ftp from Berkeley Arbitrary dimensional convex hulls, Delaunay triangulations, alpha shapes, volumes of Voronoi cells; no non-degeneracy assumptions. ANSI C, about 3K lines. Exact arithmetic, with moderate speed penalty over floating point. Incremental algorithm, with performance guarantees if sites are added in random order. Output formats include postscript in 2D, geomview in 3D.

92. HYPERBOLIC GEOMETRY
    convexity in hyperbolic geometry. We begin with a definition which holds in any geometry with a notion of segments. definition A  
    http://www.maths.gla.ac.uk/~wws/cabripages/hyperbolic/convexity.html

81-92 of 92    Back | 1  | 2  | 3  | 4  | 5