Results 171 to 180 of about 10,726 (213)

New perspectives on head and neck allometry and ecomorphology in tetrapods. [PDF]

Biol Rev Camb Philos Soc
Maher AE, Cox PG, Maddox TW, Gardiner JD, Bates KT.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Sparse convex hull coverage

Computational Geometry, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Georgiy Klimenko, Benjamin Raichel, Gregory Van Buskirk   +2 more
openaire   +2 more sources

The Convex Hull of a Hypersurface

Proceedings of the London Mathematical Society, 1985
Given a codimension 1 smooth immersed submanifold \(M^ m\) in \(E^{m+1}\), the authors study the structure of the frontier H(f) of the convex hull of the image of \(M^ m\) in \(E^{m+1}\). First of all, they show that there exists a star-shaped smooth embedding h of the m-sphere \(S^ m\) into \(E^{m+1}\) with \(H(h)=H(f)\). Using this, a panel structure
Robertson, S. A., Romero-Fuster, M. C.
openaire   +1 more source

Steaming on Convex Hulls

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., Brown, Gerald G., Rosenthal, Richard E., Washburn, Alan R.   +3 more
openaire   +3 more sources

The convex hull of ellipsoids

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, Michael Hemmer, Elmar Schömer   +2 more
openaire   +1 more source

The convex hull of a set of convex polygons

International Journal of Computer Mathematics, 1992
The 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   +1 more source

Convex Hulls for Random Lines

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   +2 more sources

A Convex Hull Inclusion Test

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   +2 more sources

A Sequentially Convex Hull

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