Results 221 to 230 of about 12,472 (260)
Some of the next articles are maybe not open access.
Proceedings of the seventeenth annual symposium on Computational geometry, 2001
The treatment of curved algebraic surfaces becomes more and more the f ocus of attention in Computational Geometry. We present a video that illustrates the computation of the convex hull of a set of ellipsoids. The underlying algorithm is an application of our work on determining a cell in a 3-dimensional arrangement of quadrics, see \cite{ghs-ccaq-01}.
Nicola Geismann +2 more
openaire +1 more source
The treatment of curved algebraic surfaces becomes more and more the f ocus of attention in Computational Geometry. We present a video that illustrates the computation of the convex hull of a set of ellipsoids. The underlying algorithm is an application of our work on determining a cell in a 3-dimensional arrangement of quadrics, see \cite{ghs-ccaq-01}.
Nicola Geismann +2 more
openaire +1 more source
Interfaces, 2007
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.
Kline, Jeffrey E. +3 more
openaire +4 more sources
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.
Kline, Jeffrey E. +3 more
openaire +4 more sources
The convex hull of a set of convex polygons
International Journal of Computer Mathematics, 1992The problem of computing the convex hull of a set of convex polygons is considered in two forms: (1) the polygons have the same number of vertices (the restricted case) and (2) the polygons have different numbers of vertices (the general case). The lower bound for the general case is first given. The restricted case is then considered briefly.
H. Chen, Jon G. Rokne
openaire +2 more sources
Journal of Algorithms, 1993
Summary: Consider \(n\) i.i.d. random lines in the plane defined by their slope and distance from the origin. The slope is uniformly distributed on \([0,2\pi]\) and independent of the distance \(R\) from the origin. These lines define a set \(I\) of \(n(n-1)/2\) intersection points. It was recently shown by \textit{M. J. Atallah} [J.
Luc Devroye, Godfried T. Toussaint
openaire +3 more sources
Summary: Consider \(n\) i.i.d. random lines in the plane defined by their slope and distance from the origin. The slope is uniformly distributed on \([0,2\pi]\) and independent of the distance \(R\) from the origin. These lines define a set \(I\) of \(n(n-1)/2\) intersection points. It was recently shown by \textit{M. J. Atallah} [J.
Luc Devroye, Godfried T. Toussaint
openaire +3 more sources
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987
A new characterization of the interior of the convex hull of a finite point set is given. An inclusion test based on this characterization is, on average, almost linear in the number of points times the dimensionality.
Thomas A. Bailey, John R. Cowles
openaire +3 more sources
A new characterization of the interior of the convex hull of a finite point set is given. An inclusion test based on this characterization is, on average, almost linear in the number of points times the dimensionality.
Thomas A. Bailey, John R. Cowles
openaire +3 more sources
Bulletin of the London Mathematical Society, 1990
Let \(S\) be a totally disconnected compact Hausdorff space and \(C(S)\) be the usual Banach space consisting of all continuous real-valued functions on \(S\). Then it is known that the closed unit ball \(U\) in \(C(S)\) is not compact but is still the closed convex hull of its extreme points.
openaire +2 more sources
Let \(S\) be a totally disconnected compact Hausdorff space and \(C(S)\) be the usual Banach space consisting of all continuous real-valued functions on \(S\). Then it is known that the closed unit ball \(U\) in \(C(S)\) is not compact but is still the closed convex hull of its extreme points.
openaire +2 more sources
The Convex Hull of Freeform Surfaces
Computing, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joon-Kyung Seong +3 more
openaire +3 more sources
SIGGRAPH Asia 2013 Technical Briefs, 2013
We present a new algorithm to reconstruct approximating watertight surfaces from finite oriented point clouds. The Convex Hull (CH) of an arbitrary set of points, constructed as the intersection of all the supporting linear half spaces, is a piecewise linear watertight surface, but usually a poor approximation of the sampled surface.
openaire +5 more sources
We present a new algorithm to reconstruct approximating watertight surfaces from finite oriented point clouds. The Convex Hull (CH) of an arbitrary set of points, constructed as the intersection of all the supporting linear half spaces, is a piecewise linear watertight surface, but usually a poor approximation of the sampled surface.
openaire +5 more sources