The complexity of incremental convex hull algorithms in R^dKALLAY, M.Information processing letters. 1984, Vol 19, Num 4, issn 0020-0190, 197Article

L'Enveloppe convexe du mouvement brownien = The convex bull of Brownian motionEL BACHIR, Mohammed.1983, 75 pThesis

Testing membership in matroid polyhedraCUNNINGHAM, W. H.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 2, pp 161-188, issn 0095-8956Article

Extracting the support function of a cavity in an isotropic elastic body from a single set of boundary dataIKEHATA, Masaru; ITOU, Hiromichi.Inverse problems. 2009, Vol 25, Num 10, issn 0266-5611, 105005.1-105005.21Article

Comments on: the computation of the convex hull of a simple polygon in linear timeELGINDY, H.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 437-440, issn 0232-0274Article

Some performance tests of convex hull algorithmsALLISON, D. C. S; NOGA, M. T.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 1, pp 2-13, issn 0006-3835Article

Random polytopes in a ballBUCHTA, C; MULLER, J.Journal of applied probability. 1984, Vol 21, Num 4, pp 753-762, issn 0021-9002Article

Technical note: cubic nervesBEZ, H. E.Computer-aided design. 1985, Vol 17, Num 8, pp 367-368, issn 0010-4485Article

Intersecting Sperner families and their convex hullsERDÖS, P. L; FRANKL, P; KATONA, G. O. H et al.Combinatorica (Print). 1984, Vol 4, Num 1, pp 21-34, issn 0209-9683Article

Convexité et mouvement brownien = Convexity and brownian motionRUIZ, Jean-Robert.1985, 56 pThesis

A convex hull algorithm for planar simple polygonsORLOWSKI, M.Pattern recognition. 1985, Vol 18, Num 5, pp 361-366, issn 0031-3203Article

On triangulations of the convex hull of n pointsROTHSCHILD, B. L; STRAUS, E. G.Combinatorica (Print). 1985, Vol 5, Num 2, pp 167-179, issn 0209-9683Article

The Graham scan triangulates simple polygonsXIANSHU KONG; EVERETT, H; TOUSSAINT, G et al.Pattern recognition letters. 1990, Vol 11, Num 11, pp 713-716, issn 0167-8655, 4 p.Article

Dynamic planar convex Hull with optimal query time and O(log n . log log n) update timeBRODAL, G. S; JACOB, R.Lecture notes in computer science. 2000, pp 57-70, issn 0302-9743, isbn 3-540-67690-2Conference Paper

Computing the convex hull of line intersectionsATALLAH, M. J.Journal of algorithms (Print). 1986, Vol 7, Num 2, pp 285-288, issn 0196-6774Article

Finding transversals for sets of simple geometric figuresEDELSBRUNNER, H.Theoretical computer science. 1985, Vol 35, Num 1, pp 55-69, issn 0304-3975Article

The enclosure method for inverse obstacle scattering problems with dynamical data over a finite time intervalIKEHATA, Masaru.Inverse problems. 2010, Vol 26, Num 5, issn 0266-5611, 055010.1-055010.20Article

A linear time algorithm for computing the convex hull of an ordered crossing polygonGHOSH, S. K; SHYAMASUNDAR, R. K.Pattern recognition. 1984, Vol 17, Num 3, pp 351-358, issn 0031-3203Article

Optimal parallel algorithms for computing convex hulls and for sortingAKL, S. G.Computing (Wien. Print). 1984, Vol 33, Num 1, pp 1-11, issn 0010-485XArticle

Conditions for equality of hulls in the calculus of variationsDOLZMANN, Georg; KIRCHHEIM, Bernd; KRISTENSEN, J. A. N et al.Archive for rational mechanics and analysis. 2000, Vol 154, Num 2, pp 93-100, issn 0003-9527Article

An ANSI C Program to determine in expected linear time the vertices of the convex hull of a set of planar pointsLARKIN, B.J.Computers & geosciences. 1991, Vol 17, Num 3, pp 431-443, issn 0098-3004, 13 p.Article

On the conditions for success of Sklansky's convex hull algorithmORLOWSKI, M.Pattern recognition. 1983, Vol 16, Num 6, pp 579-586, issn 0031-3203Article

On generalized bisection of n-simplicesHORST, R.Mathematics of computation. 1997, Vol 66, Num 218, pp 691-698, issn 0025-5718Article

A historical note on convex hull finding algorithmsTOUSSAINT, G. T.Pattern recognition letters. 1985, Vol 3, Num 1, pp 21-28, issn 0167-8655Article

On the definition and computation of rectinlinear convex hullsOTTAMNN, T; SOISALON-SOININEN, E; WOOD, D et al.Information sciences. 1984, Vol 33, Num 3, pp 157-171, issn 0020-0255Article