81. Complexity Of Convex Optimization Using Geometry-based Measures And A Reference Complexity of convex Optimization using geometrybased Measures and a ReferencePoint Robert M. Freund Abstract Our concern lies in solving the following http://www.optimization-online.org/DB_HTML/2001/10/378.html

Complexity of Convex Optimization using Geometry-based Measures and a Reference Point Robert M. Freund Abstract Keywords : convex optimization, complexity, interior-point method, barrier method Category 1 : Convex and Nonsmooth Optimization ( ) Category 2 : Linear, Cone and Semidefinite Programming ( ) Citation : MIT Operations Research Center Working paper, MIT, September, 2001 Download Postscript Entry Submitted : 10/01/2001 Entry Accepted : 10/01/2001 Entry Last Modified : 10/01/2001 Modify/Update this entry Back to Optimization Online

82. Geometry Of Homogeneous Convex Cones, Duality Mapping, And Optimal Self-concorda geometry of homogeneous convex cones, duality mapping, and optimal selfconcordantbarriers Van Anh Truong Levent Tuncel Abstract We study homogeneous convex http://www.optimization-online.org/DB_HTML/2002/06/489.html

Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers Van Anh Truong Levent Tuncel Abstract Keywords Category 1 : Linear, Cone and Semidefinite Programming ( ) Citation Download Compressed Postscript Entry Submitted : 06/10/2002 Entry Last Modified : 06/18/2002 Modify/Update this entry Back to Optimization Online

83. > Java > Computational Geometry convex Hull (Wismath) There are many solutions to the convex hull problem. Thegeometry Applet - This geometry applet is being used to illustrate Euclid's http://www.mathtools.net/Java/Computational_geometry/

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. LEDA Guide: Convex Hulls Manual page. Click geometry Algorithms (geo_alg) to see the manual page forthe convex hulls algorithms. See also 3D convex Hull Algorithms (d3_hull) http://www.algorithmic-solutions.info/leda_guide/geo_algs/convex_hull.html

Algorithmic Solutions LEDA LEDA Guide Geometry Algorithms Convex Hulls What is a Convex Hull A set of points C is called convex if for any two points p and q in C the entire segment is contained in C . The convex hull of a set of points is the smallest convex set containing S On the right you see a set of points in the plane, the points on the convex hull are drawn in red. The picture is a screenshot from the example of how to compute a convex hull Example of how to compute a convex hull The function computes the convex hull of the points in L and returns its list of vertices. The cyclic order of the vertices in the result corresponds to the counter-clockwise order of the vertices on the hull. We use the notation POINT to indicate that the algorithm works both for points and . See also Writing Kernel Independent Code Alternative Algorithms for Convex Hull LEDA provides three different algorithms for computing the convex hull of a point set Sweep Algorithm: Running time: worst and best case: O(nlogn) Incremental Construction: Running time: worst case: O(n average case: O(nlogn) best case: O(n) Randomized Incremental Construction: Expected running time: O(nlogn) The randomized incremental construction is the default algorithm for convex hull. It is generally faster in practice than incremental construction. It is also faster than the sweep algorithm if there are only few hull vertices. If the input points are on the unit circle the sweep algorithm is faster. More details can be found in the

85. HYPERBOLIC GEOMETRY First, some results which are true in both euclidean and hyperbolic geometry. Lemma1 If S and T are convex, then so is S n T. proof If A and B are in S n T http://www.maths.gla.ac.uk/~wws/cabripages/hyperbolic/convexity.html

86. Applied Geometry & Discrete Mathematics - René Brandenberg August 2003 and can be reached via Email. Research interests convexgeometry, especially the generalized radii of convex bodies. http://www-m9.mathematik.tu-muenchen.de/dm/homepages/brandenberg/

var HrefTUeVersion = "http://www.tu-muenchen.de/index_e.html"; var HrefZentrumMatheVersion = "http://www.mathematik.tu-muenchen.de/"; var HrefInstituteVersion = "/"; var HrefHarvestseVersion = "http://www.ma.tum.de/search/"; var HrefGermanVersion = "./index.de.html"; Homepage of the Chair Members Brandenberg Office Zi. 02.04.059 Boltzmannstr. 3 Telefon Telefax E-mail brandenb@mathematik.tu-muenchen.de Address Consultation hours I will be at the University of Vienna until August 2003 and can be reached via Email Research interests: Convex geometry, especially the generalized radii of convex bodies Computational convexity , especially the approximation of inner and outer j-radii Discrete tomography , especially the polyatomic case Publikationen Buch: Papers Preprints PhD Thesis: Radii of Convex Bodies

87. Directory Of Computational Geometry Software Lot of categories and links.Category Science Math geometry Computational geometry Software......Up geometry Center Downloadable Software Directory of Computationalgeometry Software. Up geometry Center Downloadable Software http://www.geom.umn.edu/software/cglist/

Up: Geometry Center Downloadable Software Directory of Computational Geometry Software This page contains a list of computational geometry programs and packages. If you have, or know of, any others, please send me mail . I'm also interested in tools, like arithmetic or linear algebra packages. I have made no attempt to determine the quality of any of these programs, and their inclusion here should not be seen as any kind of recommendation or endorsement. But I am interested in hearing about your experiences with them. Nina Amenta , Collector Contents What's new? Collections Arbitrary dimensional convex hull, Voronoi diagram, Delaunay triangulation Low dimensional convex hull, Voronoi diagram, Delaunay triangulation ... Wish list! Other related algorithmic Web sites: comp.graphics.algorithms FAQ BSP tree FAQ Linear programming FAQ Robert Schneiders' Mesh generation page The computer vision source code page, off the CMU computer vision home page . The home page has lots of pointers to related areas like pattern recognition and robotics, which also have interesting software. Georg Sander's list of graph drawing software Eric Haines' and Nick Fotis' list of computer graphics ftp sites More sites of computational geometric interest: Jeff Erickson's computational geometry page The Carleton computational geometry resource guide David Eppstein's Geometry in Action page, listing applications of computational geometry, and his fascinating

88. The Geometry Junkyard: Polyhedra And Polytopes List of links to sites on geometric properties of polygons, polyhedra, and higher dimensional polytopes.Category Science Math geometry Polyhedra and Polytopes...... Daniel Green's geometry page. Green makes models of regular sponges (infinite nonconvexgeneralizations of Platonic solids) out of plastic Polydron pieces. http://www.ics.uci.edu/~eppstein/junkyard/polytope.html

Polyhedra and Polytopes This page includes pointers on geometric properties of polygons, polyhedra, and higher dimensional polytopes (particularly convex polytopes). Other pages of the junkyard collect related information on triangles, tetrahedra, and simplices cubes and hypercubes polyhedral models , and symmetry of regular polytopes Adventures among the toroids . Reference to a book on polyhedral tori by B. M. Stewart. Bob Allanson's Polyhedra Page . Nice animated-GIF line art of the Platonic solids, Archimedean solids, and Archimedean duals. Almost research-related maths pictures . A. Kepert approximates superellipsoids by polyhedra. Archimedean polyhedra , Miroslav Vicher. Archimedean solids: John Conway describes some interesting maps among the Archimedean polytopes . Eric Weisstein lists properties and pictures of the Archimedean solids Rolf Asmund's polyhedra page Associahedron and Permutahedron . The associahedron represents the set of triangulations of a hexagon, with edges representing flips; the permutahedron represents the set of permutations of four objects, with edges representing swaps. This strangely asymmetric view of the associahedron (as an animated gif) shows that it has some kind of geometric relation with the permutahedron: it can be formed by cutting the permutahedron on two planes. A more symmetric view is below. See also a more detailed description of the associahedron , and Jean-Louis Loday's paper on associahedron coordinates The bellows conjecture , R. Connelly, I. Sabitov and A. Walz in Contributions to Algebra and Geometry , volume 38 (1997), No.1, 1-10. Connelly had previously discovered non-convex polyhedra which are flexible (can move through a continuous family of shapes without bending or otherwise deforming any faces); these authors prove that in any such example, the volume remains constant throughout the flexing motion.

Page 5     81-88 of 88    Back | 1  | 2  | 3  | 4  | 5