Convex hulls in the hyperbolic space
نویسندگان
چکیده
منابع مشابه
Convex Hulls in a 3-Dimensional Space
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm is an abstract polyhedron being described by a new data structure, the cell list, suggested by one of the authors. The correctness of the algorithm is proved and experimental results are presented.
متن کاملFormalizing Convex Hulls Algorithms
We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerated cases th...
متن کاملSteaming on Convex Hulls
This is a sea story about using a simple classroom example to save a great deal of money, as well as to convince beginning Postgraduate Naval School operations research students—experienced, skeptical military officers—that mathematical analysis can yield immediate results. The application is planning a ship’s transit from one point to another in a fixed amount of time, given that the ship can ...
متن کاملConvex Hulls in Concept Induction
Classi cation learning is dominated by systems which induce large num bers of small axis orthogonal decision surfaces This strongly biases such systems towards particular hypothesis types but there is reason believe that many domains have underlying concepts which do not involve axis orthog onal surfaces Further the multiplicity of small decision regions mitigates against any holistic appreciat...
متن کاملConvex Hulls of Sets in the Plane
The convex hull of a set of points is the smallest convex set containing the points. The convex hull is a fundamental concept in mathematics and computational geometry. Other problems can be reduced to finding the convex hull – for example, halfspace intersection, Delaunay triangulation, Voronoi diagram, etc. An algorithm known as Graham scan [6] achieves an O(n log n) running time. This algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2011
ISSN: 0046-5755,1572-9168
DOI: 10.1007/s10711-011-9687-8